Parallelization via Constrained Storage Mapping Optimization
Résumé
A key problem for parallelizing compilers is to find the good
tradeoff between memory expansion and parallelism. This paper is a
new step towards solving this problem. A framework for parallel
execution order and storage mapping computation is designed,
allowing time and space optimization. Constrained expansion, a
theoretical model for expansion strategies, is shown to be very
useful in this context.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...