Communication-Minimal Tiling of Uniform Dependence Loops (1996)
Cached
Download Links
- [www.cse.unsw.edu.au]
- [www.cse.unsw.edu.au]
- DBLP
Other Repositories/Bibliography
| Citations: | 34 - 3 self |
BibTeX
@MISC{Xue96communication-minimaltiling,
author = {Jingling Xue},
title = {Communication-Minimal Tiling of Uniform Dependence Loops},
year = {1996}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. Tiling is a loop transformation that a compiler uses to create automatically blocked algorithms in order to improve the benefits of the memory hierarchy and reduce the communication overhead between processors. Motivated by existing results, this paper presents a conceptually simple approach to finding tilings with a minimal amount of communication between tiles. The development of almost all results is based primarily on the inequality of arithmetic and geometric means and the concept of extremal rays from convex cones. The key insight is that a tiling that is communication-minimal must induce the same amount of communication through all faces of a tile, which restricts the search space for optimal tilings to those tiling matrices whose rows are all extremal rays in a cone. For nested loops with several special forms of dependences, closed-form optimal tilings are derived. In the general case, a procedure is given that always returns optimal tilings. An efficient implementation of t...
