A Semantic Framework To Adress Data Locality in Data Parallel Languages

Abstract : We developed a theory in order to address crucial questions of program design methodology. This theory deals with data locality which is a main issue in parallel programming. In this article, we regard this theory and its model as a minimum semantic domain for data parallel languages. The introduction of a semantic domain is justified because the classical data parallel languages (HPF and C*) have different intuitive semantics: Indeed, they use different concepts in order to express data locality. These concepts are alignment in HPF and shape in CH . Consequently these two languages define their own balance between compiler and programmer investments in order to reach program efficiency. We present our theory as a foundation for defining a better balance.
Type de document :
Article dans une revue
Parallel Computing, Elsevier, 2004, 30, pp.139-161
Liste complète des métadonnées

Contributeur : Eric Violard <>
Soumis le : mercredi 30 avril 2014 - 15:37:46
Dernière modification le : samedi 27 octobre 2018 - 01:24:34


  • HAL Id : hal-00985875, version 1


Eric Violard. A Semantic Framework To Adress Data Locality in Data Parallel Languages. Parallel Computing, Elsevier, 2004, 30, pp.139-161. 〈hal-00985875〉



Consultations de la notice