Skip to main content
Springer Nature Link
Log in

Optimizing irregular HPF applications using halos

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1999)

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

Included in the following conference series:

  • 66 Accesses

  • 7 Citations

Abstract

This paper presents language features for High Performance Fortran (HPF) to specify non-local access patterns of distributed arrays, called halos, and to control the communication associated with these non-local accesses. Using these features crucial optimization techniques required for an efficient parallelization of irregular applications may be applied. The information provided by halos is utilized by the compiler and runtime system to optimized the management of distributed arrays and the computation of communication schedules. High-level communication primitives for halos enable the programmer to avoid redundant communication, to reuse communication schedules, and to hide communication overheads by overlapping communication with computation. Performance results of a kernel from a crash simulation code on the NEC Cenju-4, the IBM SP2, and on the NEC SX-4 show that by using the proposed extensions a performance close to hand-coded message-passing codes can be achieved for irregular problems.

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. S. Barros, D. Dent, L. Isaksen, G. Robinson, G. Mozdzynski, and F. Wollenweber. The IFS model: A parallel production weather code. Parallel Computing 21, 1995.

    Google Scholar 

  2. S. Benkner, P. Mehrotra, J. Van Rosendale, and H. Zima. High-Level Management of Communication Schedules in HPF-Like Languages. ACM Proceedings International Conference on Supercomputing, Melbourne, Australia, July 1998.

    Google Scholar 

  3. S. Benkner, K. Sanjari, V. Sipkova, and B. Velkov. Parallelizing Irregular Applications with the Vienna HPF+Compiler VFC. Proceedings International Conference on High Performance Computing and Networking (HPCN’98), Amsterdam, April 1998, Lecture Notes in Computer Science, Vol. 1401, pp. 816–827, Springer Verlag.

    Google Scholar 

  4. S. Benkner. HPF+: High Performance Fortran for Advanced Industrial Applications. Proceedings International Conference on High Performance Computing and Networking (HPCN’98), Amsterdam, April 1998, Lecture Notes in Computer Science, Vol. 1401, pp. 797–808, Springer Verlag.

    Google Scholar 

  5. J. Clinckemaillie, B. Elsner, G. Lonsdale, S. Meliciani, S. Vlachoutsis, F. de Bruyne, M. Holzner. Performance Issues of the Parallel PAM-CRASH Code. The International Journal of Supercomputing Applications and High-Performance Computing, Vol. 11, No. 1, pp. 3–11, Spring 1997.

    Google Scholar 

  6. R. Das, Y.-S. Hwang, M. Uysal, J. Saltz, and A. Sussman. Applying the CHAOS/PARTI Library to Irregular Problems in Computational Chemistry and Computational Aerodynamics, Proceedings of the 1993 Scalable Parallel Libraries Conference, pp. 45–56, IEEE Computer Society Press, October 1993.

    Google Scholar 

  7. High Performance Fortran Forum. High Performance Fortran Language Specification 2.0, Rice University, January, 1997.

    Google Scholar 

  8. M. W. Hall, S. Hirandani, K. Kennedy, and C.-W. Tseng. Interprocedural compilation of Fortran D for MIMD distributed-memory machines. Proceedings of Supercomputing (SC92), Minneapolis, November, 1992.

    Google Scholar 

  9. Message Passing Interface Forum. MPI: A Message-Passing Interface Standard Vers. 1.1, June 1995.

    Google Scholar 

  10. R. von Hanxleden, K. Kennedy, C. Koelbel, R. Das, and J. Saltz. Compiler Analysis for Irregular Problems in Fortran D. Proceedings of the 5th Workshop on Languages and Compilers for Parallel Computing, New Haven, August 1992.

    Google Scholar 

  11. JAHPF Homepage: http://www.tokyo.rist.or.jp/~shunchan/index-e.html

    Google Scholar 

  12. R. Ponnusamy, J. Saltz, and A. Choudhary. Runtime Compilation Techniques for Data Partitioning and Communication Schedule Reuse. Proceedings Supercomputing ’93, pp. 361–370, 1993.

    Google Scholar 

  13. J. Saltz and K. Crowley and R. Mirchandaney and H. Berryman. Run-Time Scheduling and Execution of Loops on Message Passing Machines. Journal of Parallel and Distributed Computing, 8(4), pp. 303–312, April 1990.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. C&C Research Laboratories, NEC Europe Ltd, Rathausallee 10, D-53757 St, Augustin, Germany

    Siegfried Benkner

Authors
  1. Siegfried Benkner
    View author publications

    Search author on:PubMed Google Scholar

Editor information

José Rolim Frank Mueller Albert Y. Zomaya Fikret Ercal Stephan Olariu Binoy Ravindran Jan Gustafsson Hiroaki Takada Ron Olsson Laxmikant V. Kale Pete Beckman Matthew Haines Hossam ElGindy Denis Caromel Serge Chaumette Geoffrey Fox Yi Pan Keqin Li Tao Yang G. Chiola G. Conte L. V. Mancini Domenique Méry Beverly Sanders Devesh Bhatt Viktor Prasanna

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Benkner, S. (1999). Optimizing irregular HPF applications using halos. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097986

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics