The Parallel Runtime

Compiling ZPL Programs

•Because ZPL is high level, most optimizations have a huge payoff

•Examples of important optimizations

rightedge := max<< Pts.x;

topedge := max<< Pts.y;

leftedge := min<< Pts.x;

bottomedge := min<< Pts.y;

converts to 1 Ladner/Fischer tree on 4-part data

North := A@N + B@N + C@N;

combines all communication to north (and south) neighbors