Optimal Compilation of HPF Remappings - Mines Paris Accéder directement au contenu
Article Dans Une Revue Journal of Parallel and Distributed Computing Année : 1996

Optimal Compilation of HPF Remappings

Fabien Coelho
Corinne Ancourt


Applications with varying array access patterns require to dynamically change array mappings on distributed-memory parallel machines. HPF (High Performance Fortran) provides such remappings, on data that can be replicated, explicitly through therealign andredistribute directives and implicitly at procedure calls and returns. However such features are left out of the HPF subset or of the currently discussed hpf kernel for effeciency reasons. This paper presents a new compilation technique to handle hpf remappings for message-passing parallel architectures. The first phase is global and removes all useless remappings that appear naturally in procedures. The code generated by the second phase takes advantage of replications to shorten the remapping time. It is proved optimal: A minimal number of messages, containing only the required data, is sent over the network. The technique is fully implemented in HPFC, our prototype HPF compiler. Experiments were performed on a Dec Alpha farm.
Fichier principal
Vignette du fichier
A-277.pdf (369.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00752603 , version 1 (16-11-2012)


  • HAL Id : hal-00752603 , version 1


Fabien Coelho, Corinne Ancourt. Optimal Compilation of HPF Remappings. Journal of Parallel and Distributed Computing, 1996, Vol. 28, pp. 229-236. ⟨hal-00752603⟩
64 Consultations
410 Téléchargements


Gmail Facebook X LinkedIn More