Skip to main content
SpringerLink
Log in

Statement-level communication-free partitioning techniques for parallelizing compilers

  • Communication Optimization
  • Conference paper
  • First Online:
Languages and Compilers for Parallel Computing (LCPC 1996)

Part of the book series: Lecture Notes in Computer Science ((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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Article  Google Scholar 

  2. K. Hoffman and R. Kunze. Linear Algebra. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, second edition, 1971.

    Google Scholar 

  3. C.-H. Huang and P. Sadayappan. Communication-free hyperplane partitioning of nested loops. Journal of Parallel and Distributed Computing, 19:90–102, 1993.

    Article  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 

  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.

    Article  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 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Central University, 32054, Chung-Li, Taiwan

    Kuei-Ping Shih & Jang-Ping Sheu

  2. Department of Computer and Information Science, The Ohio State University, 43210-1277, Columbus, OH

    Chua-Huang Huang

Authors
  1. Kuei-Ping Shih
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jang-Ping Sheu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chua-Huang Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

David Sehr Utpal Banerjee David Gelernter Alex Nicolau David Padua

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shih, KP., Sheu, JP., Huang, CH. (1997). Statement-level communication-free partitioning techniques for parallelizing compilers. In: Sehr, D., Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds) Languages and Compilers for Parallel Computing. LCPC 1996. Lecture Notes in Computer Science, vol 1239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017265

Download citation

  • DOI: https://doi.org/10.1007/BFb0017265

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63091-3

  • Online ISBN: 978-3-540-69128-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation