Loop Partitioning versus Tiling for Cache-based Multiprocessors.

Abstract : In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We improve recent results of Agarwal, Kranz and Natarajan in several 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 those of Agarwal, Kranz and Natarajan to ensure the fairness of the comparisons.
Document type :
Reports
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02101823
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:07:14 AM
Last modification on : Tuesday, May 21, 2019 - 1:28:49 AM

File

RR1998-13.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02101823, version 1

Collections

Citation

Fabrice Rastello, Yves Robert. Loop Partitioning versus Tiling for Cache-based Multiprocessors.. [Research Report] LIP RR-1998-13, Laboratoire de l'informatique du parallélisme. 1998, 2+21p. ⟨hal-02101823⟩

Share

Metrics

Record views

4

Files downloads

11