Internal Representation

• The Abstract Syntax Tree (AST).

• The Control Flow Graph.

• Computation Partitioning:

  A(1,1)=0 ON_HOME A(1,1)
  
  DO I=2,N ON_HOME A(0:N-1,1:M)
  DO J=1,M ON_HOME A(I-1,1:M)
  B(I,J)=A(I-1,J) ON_HOME A(I-1,J)
  

• Communication Description:

  • Location in the AST.
  • Logical Pattern (SHIFT, BROADCAST, REDUCTION, etc.).
  • SEND/RECV communication sets:

Previous slide

Next slide

Back to first slide

View graphic version