Mapping Normalization Technique on the HPF Compiler fhpf

  • Hidetoshi Iwashita
  • Masaki Aoki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4759)


We propose a technique of mapping normalization which reduces the variety of data and computational mapping representation of HPF into a certain standard form. The base of the reduction is a set of equivalent transformations of an HPF program, using composition of alignment and affine transformation of data and loop indices. The mapping normalization technique was implemented in the HPF compiler fhpf, and made the succeeding processes, such as local access detection and SPMD conversion, much slimmer. The measurement result shows that performance of the MPI code generated by the fhpf compiler is fairly comparable to the one written by a skillful MPI programmer.


HPF compiler distribution MPI 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Allen, R., Callahan, D., Kennedy, K.: Automatic Decomposition of Scientific Programs for Parallel Execution. In: Conference Record of the 14th ACM Symposium on Principles of Programming Languages, pp. 63–76 (January 1987)Google Scholar
  2. 2.
    Banerjee, U.: Unimodular transformations of double loops. In: Proceedings of the Workshop on Advances in Languages and Compilers for Parallel Processing, pp. 192–219 (August 1990)Google Scholar
  3. 3.
    High Performance Fortran Forum: High Performance Fortran Language Specification Version 2.0. (1997),
  4. 4.
  5. 5.
    Iwashita, H., Hotta, K., Kamiya, S., van Waveren, M.: Towards a Lightweight HPF Compiler. In: Zima, H.P., Joe, K., Sato, M., Seo, Y., Shimasaki, M. (eds.) ISHPC 2002. LNCS, vol. 2327, pp. 526–538. Springer, Heidelberg (2002)Google Scholar
  6. 6.
    Japan Association for High Performance Fortran (JAHPF): HPF/JA Language Specification Version 1.0 (November 1999),
  7. 7.
    Kelly, W., Pugh, W., Rosser, E.: Code Generation for Multiple Mappings. In: Frontiers 1995. The 5th Symposium on the Frontiers of Massively Parallel Computation, McLean, VA (February 1995)Google Scholar
  8. 8.
    Li, W., Pingali, K.: A Singular Loop Transformation Framework Based on Non-Singular Matrices. Technical Report TR 92-1294, Cornell University, Ithaca, NY (July 1992)Google Scholar
  9. 9.
    Li, W., Pingali, K.: Access normalization: loop restructuring for NUMA computers. ACM Transactions on Computer Systems (TOCS) 11(4), 353–375 (1993)CrossRefGoogle Scholar
  10. 10.
    Mellor-Crummey, J.M., Adve, V.S., Broom, B., Chavarria-Miranda, D.G., Fowler, R.J., Jin, G., Kennedy, K., Yi, Q.: Advanced optimization strategies in the Rice dHPF compiler. Concurrency and Computation: Practice and Experience 14(8-9), 741–767 (2002)zbMATHCrossRefGoogle Scholar
  11. 11.
    Message Passing Interface Forum.
  12. 12.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Hidetoshi Iwashita
    • 1
  • Masaki Aoki
    • 2
  1. 1.Next Generation Technical Computing Unit, Fujitsu LimitedNumazu-shiJapan
  2. 2.Software Unit,Fujitsu LimitedNumazu-shiJapan

Personalised recommendations