Maximal Static Expansion
Résumé
Memory expansions are classical means to extract parallelism from
imperative programs. However, current techniques require some
run-time mechanism to restore data flow when expansion maps two
definitions reaching the same use to two different memory locations
(e.g., phi functions in the SSA framework). This paper presents
an expansion framework for any type of data structure in any
imperative program, without the need for dynamic data flow
restoration. The key idea is to group together definitions that
reach a common use. We show that such an expansion boils down to
mapping each group to a memory cell.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...