Automatically Parallelizable Code

• linear assignments:
• reductions:
• triangular assignments
• NOT parallelizable:
  • early exits

DO I=1,N

S = S + X(I)

ENDDO

DO I=1,N

A(I) = B(I) + X(I)

ENDDO

DO I=1,N

DO J=I,N

A(J,I) = B(J,I) + X(I)

ENDDO

Previous slide

Next slide

Back to first slide

View graphic version