Storage Mapping Optimization for Parallel Programs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1999

Storage Mapping Optimization for Parallel Programs

Résumé

Data dependences are known to hamper efficient parallelization of programs. Memory expansion is a general method to remove dependences in assigning distinct memory locations to dependent writes. Parallelization via memory expansion requires both moderation in the expansion degree and efficiency at run-time. We present a general storage mapping optimization framework for imperative programs, applicable to most loop nest parallelization techniques.
Fichier principal
Vignette du fichier
CL99.pdf (188.02 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01257316 , version 1 (20-01-2016)

Identifiants

  • HAL Id : hal-01257316 , version 1

Citer

Albert Cohen, Vincent Lefebvre. Storage Mapping Optimization for Parallel Programs. Euro-Par'99 - Parallel processing, Aug 1999, Toulouse, France. pp.375--382. ⟨hal-01257316⟩

Collections

CNRS UVSQ
93 Consultations
104 Téléchargements

Partager

Gmail Facebook X LinkedIn More