34
Compilation Challenge for Parallelism
•All of
these memory models exist on production machines …
•How
can a single compiler target all models?
•Worried
by this problem, the ZPL designers modeled communication by an abstraction called Ironman
Communication
•Ironman
abstracts a CTA communication as a time-dependent load, store
•Ironman
is not biased for/against any comm mechanism
Ironman is designed for compilers, not programmers