Skip to main content

A technique to eliminate redundant inter-processor communication on parallelizing compiler TINPAR

  • IV Compilers
  • Conference paper
  • First Online:
High Performance Computing (ISHPC 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1336))

Included in the following conference series:

  • 103 Accesses

Abstract

Optimizing inter-processor(PE) communication is crucial for parallelizing compilers for message-passing parallel machines to achieve high performance. In this paper, we propose a technique to eliminate redundant inter-PE messages. This technique utilizes a data-flow analysis to find a definition point that corresponds to a use point where the definition and the use are occurred in different PEs. If several read accesses occurred in the same PE use the data defined at the same definition point in another PE, redundant inter-PE messages are eliminated as follows: only one inter-PE communication is performed for the earliest read access and the previously received data axe used for the following read accesses. In order to guarantee the consistency of the data, a valid flag and a sent flag are provided for each chunk of received data. The control of these flags is equivalent to the coherence control by the self invalidation on a compiler aided cache coherence scheme.

Research Fellow of the Japan Society for the Promotion of Science

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. High Performance Fortran Forum. High Performance Fortran language specification (ver. 2.0). Technical report, January 1997.

    Google Scholar 

  2. SeemaHiranandani, Ken Kennedy, and Chau-Wen Tseng. Evaluating compiler optimizations for fortran D. J. Parallel and Distributed Computing, 21:27–45, 1994.

    Article  Google Scholar 

  3. Atsushi Kubota, Ikuo Miyoshi, Koji Maeyama, Shin ya Goto, Shin ichiro Mori, Hiroshi Nakashima, and Shinji Tomita. TINPAR: A parallelizing compiler for messagepassing multiprocessors. In Proc. of Int'l Symposium on Parallel and Distributed Supercomputing, pages 214–223, September 1995.

    Google Scholar 

  4. Dror E. Maydan, Saman P. Amarasinghe, and Monica S. Lam. Array data-flow analysis and its use in array privatization. In 20'th Annual ACM Symposium on Principles of Programming Languages, pages 2–15, January 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Constantine Polychronopoulos Kazuki Joe Keijiro Araki Makoto Amamiya

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kubota, A. et al. (1997). A technique to eliminate redundant inter-processor communication on parallelizing compiler TINPAR. In: Polychronopoulos, C., Joe, K., Araki, K., Amamiya, M. (eds) High Performance Computing. ISHPC 1997. Lecture Notes in Computer Science, vol 1336. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024216

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63766-0

  • Online ISBN: 978-3-540-69644-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics