Skip to main content
SpringerLink
Log in

Interprocedural array alignment analysis

  • 3. Computer Science
  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1998)

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

Included in the following conference series:

  • 246 Accesses

Abstract

The specification of efficient data distribution schemes is one of the major tasks in programming DMMPs with data parallel languages. Although there are no optimal strategies for generating such data distributions, several heuristics have been developed to provide some support to the user. We presented an overview of an automatic alignment analysis tool elsewhere, which is able to automatically generate alignment proposals for the arrays accessed in a procedure and thus simplifies the data distribution problem. In this paper we extend our previous work to interprocedural analysis taking into account dynamic realignment. This feature is essential for applying alignment analysis to real programs.

The work described in this paper was supported by the Austrian Science Fund FWF (SFB F011 “AURORA”) and the European Union (ESPRIT project 23502 “FITS”).

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. E. Ayguade, J. Garcia, M. Girones, M. Luz Grande, and J. Labarta. DDT: A Research Tool for Automatic Data Distribution in HPF. Technical Report UPC-CEPBA-1995-20, Polytechnic University of Catalunya, Barcelona, Spain, 1995.

    Google Scholar 

  2. S. Chatterjee, J.R. Gilbert, R. Schreiber, and S. Teng. Automatic Array Alignment in Data-Parallel Programs. In Proceedings of the Twentieth Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, Charleston, January 1993.

    Google Scholar 

  3. C. G. Diderich and M. Gengler. Solving the constant-degree parallelism alignment problem. In Proc. of EuroPar '96, August 1996.

    Google Scholar 

  4. M. Dion and Y. Robert. Mapping Affine Loop Nests: New Results. Technical Report Nr. 94-30, Laboratoire de l'Informatique du Parallèlisme, Ecole Normale Supèrieure de Lyon, November 1994.

    Google Scholar 

  5. High Performance Fortran Forum. High Performance Fortran Language Specification Version 2.0, January 1997.

    Google Scholar 

  6. J. Garcia, E. Ayguadè, and J. Labarta. A Novel Approach Towards Automatic Data Distribution. In Workshop on Automatic Data Layout and Performance Prediction, Houston, April 1995. CRPC, Rice University.

    Google Scholar 

  7. J. Garcia, E.Ayguadè, and J. Labarta. Dynamic Data Distribution with Control Flow Analysis. In Proceedings Supercomputing 96, Pittsburgh, PA, November 1996.

    Google Scholar 

  8. M. Gupta. Automatic Data Partitioning on Distributed Memory Mulitcomputers. PhD thesis, Coordinated Science Lab, University of Illinois at Urbana-Champaign, 1992.

    Google Scholar 

  9. K. Kennedy and U. Kremer. Automatic Data Layout for High Performance Fortran. In Proceedings of Supercomputing 95, San Diego,CA, December 1995.

    Google Scholar 

  10. U. Kremer. NP-completeness of Dynamic Remapping. In Fourth International Workshop on Compilers for Parallel Computers. Delft University of Technology, Dezember 1993.

    Google Scholar 

  11. E. Laure and B. Chapman. Alignment Analysis within the VFCS-A pragmatic Method for Supporting Data Distribution. TR 96-2, Institute for Software Technology and Parallel Systems, University of Vienna, October 1996.

    Google Scholar 

  12. E. Laure and B. Chapman. Combining Inter-and Intradimensional Alignment Analysis to Support Data Distribution. In Proceedings HPCN Europe 1997, Lecture Notes in Computer Science 1225, pages 830–839. Springer, April 1997.

    Google Scholar 

  13. E. Laure and B. Chapman. Interprocedural Array Alignment Analysis. TR 977, Institute for Software Technology and Parallel Systems, University of Vienna, 1997.

    Google Scholar 

  14. J. Li and M. Chen. Index Domain Alignment: Minimizing Cost of Cross-Referencing Between Distributed Arrays. Technical Report YALEU/DCS/TR-72, Yale University, November 1989.

    Google Scholar 

  15. Qi Ning, V. Van Dongen, and G.R. Gao. Automatic Data and Computation Decomposition for Distributed Memory Machines. In 28th Hawaii International Conference on System Science Wailea, Maui, Hawaii, January 1995.

    Google Scholar 

  16. H.P. Zima and B.M. Chapman. Supercompilers for Parallel and Vector Computers. ACM Press Frontier Series. ACM, Addison-Wesely, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Software Technology and Parallel Systems, University of Vienna, Liechtensteinstrasse 22, A-1090, Vienna, Austria

    Erwin Laure

  2. VCPC, European Centre for Parallel Computing at Vienna, University of Vienna, Liechtensteinstrasse 22, A-1090, Vienna, Austria

    Barbara Chapman

Authors
  1. Erwin Laure
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Barbara Chapman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Peter Sloot Marian Bubak Bob Hertzberger

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Laure, E., Chapman, B. (1998). Interprocedural array alignment analysis. In: Sloot, P., Bubak, M., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1998. Lecture Notes in Computer Science, vol 1401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037202

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64443-9

  • Online ISBN: 978-3-540-69783-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation