• Published 1996

Optimal Tiling of Two-Dimensional Uniform Recurrences

@inproceedings{Rajopadhye1996OptimalTO,
  title={Optimal Tiling of Two-Dimensional Uniform Recurrences},
  author={Sanjay V. Rajopadhye},
  year={1996}
}
Iteration space tiling is a common strategy used by parallelizing compilers and in performance tuning of parallel codes. We address the problem of determining the tile size that minimizes the total execution time of such a program. We restrict our attention to uniform dependency computations which have a parallelogram shaped two dimensional iteration space, and the target architecture is a linear array (or a ring). Our approach is an extension of the space-time mapping used in systolic… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-5 OF 5 CITATIONS

Three-dimensional orthogonal tile sizing problem : mathematical programming approach

  • Proceedings IEEE International Conference on Application-Specific Systems, Architectures and Processors
  • 1997
VIEW 13 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Partitioning and scheduling loops on NOWs

  • Computer Communications
  • 1999
VIEW 1 EXCERPT
CITES METHODS

Two-dimensional orthogonal tiling: from theory to practice

  • Proceedings of 3rd International Conference on High Performance Computing (HiPC)
  • 1996

References

Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES