Skip to Main content Skip to Navigation
Journal articles

Optimal Compilation of HPF Remappings

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [36 references]  Display  Hide  Download
Contributor : Claire Medrala Connect in order to contact the contributor
Submitted on : Friday, November 16, 2012 - 10:30:49 AM
Last modification on : Wednesday, November 17, 2021 - 12:31:44 PM
Long-term archiving on: : Saturday, December 17, 2016 - 11:00:49 AM


Files produced by the author(s)


  • HAL Id : hal-00752603, version 1


Fabien Coelho, Corinne Ancourt. Optimal Compilation of HPF Remappings. Journal of Parallel and Distributed Computing, Elsevier, 1996, Vol. 28, pp. 229-236. ⟨hal-00752603⟩



Record views


Files downloads