Loop Partitioning versus Tiling for Cache-based Multiprocessors
Fabrice Rastello, Fabrice Rastello, Yves Robert, Yves Robert · 1998
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We improve recent results of Agarwal, Kranz and Natarajan [1] inseveral directions. We give a more accurate estimation of the cumulative footprint, and we derive a much more powerful algorithm to determine the optimal tile shape. We illustrate the superiority of our algorithm on the same examples as in [1] to ensure the fairness of the comparisons.