Maximal Static Expansion

Denis Barthou (1) , Albert Cohen (1) , Jean-François Collard (1)

1 PRISM - Parallélisme, Réseaux, Systèmes, Modélisation

Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations either fail or require some run-time mechanism to restore the data flow. 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 the write operations that participate in the flow of the same datum. We show that such an expansion boils down to mapping each group to a single memory cell. We give a practical algorithm for code transformation. This algorithm, however, is valid for (possibly non-affine) loops over arrays only.

Mots clés: expansion of data structures; privatization; single assignment

Domaines: Langage de programmation [cs.PL]; Calcul parallèle, distribué et partagé [cs.DC]; Systèmes embarqués

Denis Barthou, Albert Cohen, Jean-François Collard. Maximal Static Expansion. Symp. on Principles of Programming Languages (POPL), Jan 1998, San Diego, California, United States. pp.98-106. ⟨hal-01257319⟩