On the Parallel Execution Time of Tiled Loops

@article{Hgstedt2003OnTP,
  title={On the Parallel Execution Time of Tiled Loops},
  author={Karin H{\"o}gstedt and Larry Carter and Jeanne Ferrante},
  journal={IEEE Trans. Parallel Distrib. Syst.},
  year={2003},
  volume={14},
  pages={307-321}
}
Many computationally-intensive programs, such as those for differential equations, spatial interpolation, and dynamic programming, spend a large portion of their execution time in multiply-nested loops that have a regular stencil of data dependences. Tiling is a well-known compiler optimization that improves performance on such loops, particularly for computers with a multileveled hierarchy of parallelism and memory. Most previous work on tiling is limited in at least one of the following ways… CONTINUE READING
Highly Cited
This paper has 62 citations. REVIEW CITATIONS