Advertisement

Statement-level communication-free partitioning techniques for parallelizing compilers

  • Kuei-Ping Shih
  • Jang-Ping Sheu
  • Chua-Huang Huang
Communication Optimization
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1239)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    T. S. Chen and J. P. Sheu. Communication-free data allocation techniques for parallelizing compilers on multicomputers. IEEE Transactions on Parallel and Distributed Systems, 5(9):924–938, September 1994.CrossRefGoogle Scholar
  2. 2.
    K. Hoffman and R. Kunze. Linear Algebra. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, second edition, 1971.Google Scholar
  3. 3.
    C.-H. Huang and P. Sadayappan. Communication-free hyperplane partitioning of nested loops. Journal of Parallel and Distributed Computing, 19:90–102, 1993.CrossRefGoogle Scholar
  4. 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
  5. 5.
    J. Ramanujam and P. Sadayappan. Compile-time techniques for data distribution in distributed memory machines. IEEE Transactions on Parallel and Distributed Systems, 2(4):472–482, October 1991.CrossRefGoogle Scholar
  6. 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. 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. 8.
    M. J. Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley Publishing Company, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Kuei-Ping Shih
    • 1
  • Jang-Ping Sheu
    • 1
  • Chua-Huang Huang
    • 2
  1. 1.Department of Computer Science and Information EngineeringNational Central UniversityChung-LiTaiwan
  2. 2.Department of Computer and Information ScienceThe Ohio State UniversityColumbus

Personalised recommendations