Statement-level communication-free partitioning techniques for parallelizing compilers
This paper addresses the problem of communication-free partitioning of iteration spaces and data spaces along hyperplanes. We consider statement-level partitioning for the iteration spaces. The technique explicitly formulates array references as transformations from statementiteration spaces to data spaces. Based on these transformations, the necessary and sufficient conditions for the feasibility of communication-free hyperplane partitions are presented.
Unable to display preview. Download preview PDF.
- 2.K. Hoffman and R. Kunze. Linear Algebra. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, second edition, 1971.Google Scholar
- 4.A. W. Lim and M. S. Lam. Communication-free parallelization via affine transformations. In Proceedings of the 7th Workshop on Programming Languages and Compilers for Parallel Computing, August 1994.Google Scholar
- 6.K.-P. Shih, J.-P. Sheu, and C.-H. Huang. Statement-level communication-free partitioning techniques for parallelizing compilers. Technical Report NCU-PPL-Tr-96-01, Dept. of Computer Science and Information Engineering, National Central University, Taiwan, 1996.Google Scholar
- 7.M. E. Wolf and M. S. Lam. A data locality optimizing algorithm. In Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, pages 30–44, June 1991.Google Scholar
- 8.M. J. Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley Publishing Company, 1996.Google Scholar