Sequential loops enclosing par

The rules described in the previous section for inferring the type dependence in a par statement have to be generalized to deal with cases when sequential loops enclose the par statement. In the case of nested sequential loops, it is the outermost loop that carries the dependence across iterations, that is used to determine the type of dependence. When some of the loops in the nested structure are parallel (i.e. par statements), the following general rule can be used to infer the type of dependence:

• The outermost sequential loop that carries the dependence determines the type of dependence. If no sequential loop carries the dependence, lexical ordering determines the type of dependence.