Accéder directement au contenu Accéder directement à la navigation
Article dans une revue

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.
Type de document :
Article dans une revue
Liste complète des métadonnées

Littérature citée [36 références]  Voir  Masquer  Télécharger

https://hal-mines-paristech.archives-ouvertes.fr/hal-00752603
Contributeur : Claire Medrala <>
Soumis le : vendredi 16 novembre 2012 - 10:30:49
Dernière modification le : jeudi 17 septembre 2020 - 12:29:52
Archivage à long terme le : : samedi 17 décembre 2016 - 11:00:49

Fichier

A-277.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00752603, version 1

Citation

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

Partager

Métriques

Consultations de la notice

229

Téléchargements de fichiers

376