Skip to Main content Skip to Navigation
New interface
Conference papers

Maximal Static Expansion

Abstract : 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.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Albert Cohen Connect in order to contact the contributor
Submitted on : Wednesday, January 20, 2016 - 10:19:19 AM
Last modification on : Friday, January 7, 2022 - 12:40:01 PM
Long-term archiving on: : Thursday, April 21, 2016 - 11:15:14 AM


Files produced by the author(s)


  • HAL Id : hal-01257319, version 1



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⟩



Record views


Files downloads