Determining the idle time of a tiling: new results - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1997

Determining the idle time of a tiling: new results


In the framework of fully permutable loops, tiling has been studied extensively as a source-to-source program transformation. We build upon recent results by Hogsted, Carter, and Ferrante (1997), who aim at determining the cumulated idle time spent by all processors while executing the partitioned (tiled) computation domain. We propose new, much shorter proofs of all their results and extend these in several important directions. More precisely, we provide an accurate solution for all values of the rise parameter that relates the shape of the iteration space to that of the tiles, and for all possible distributions of the tiles to processors. In contrast, the authors in Hogsted, Carter, and Ferrante (1997) deal only with a limited number of cases and provide upper bounds rather than exact formulas
No file

Dates and versions

hal-00856894 , version 1 (02-09-2013)



Frédéric Desprez, Jack Dongarra, Fabrice Rastello, Yves Robert. Determining the idle time of a tiling: new results. Parallel Architectures and Compilation Techniques PACT'97, Nov 1997, San Francisco, United States. pp.307-317, ⟨10.1109/PACT.1997.644026⟩. ⟨hal-00856894⟩
96 View
0 Download



Gmail Facebook X LinkedIn More