Tiling with Limited Resources
Résumé
In the framework of perfect loop nests with uniform dependences, tiling has been extensively studied as a source-to-source program transformati- on. Little work has been devoted to the mapping and scheduling of the tiles on to physical processors. We present several new results in the context of limited computational resources, and assuming communication-computation overlap. In particular, under some reasonable assumptions, we derive the optimal mapping and scheduling of tiles to physical processors.