Lattice-based array contraction : from theory to practice

  • Alias, Christophe
  • Baray, Fabrice
  • Darte, Alain
  • Laboratoire de l'informatique du parallélisme
ORKG logo Add to ORKG
Publication date
November 2007
Publisher
LIP

Abstract

(eng) We build on prior work on intra-array memory reuse, for which a general theoretical framework was proposed based on lattice theory. Intra-array memory reuse is a way of reducing the size of a temporary array by folding, thanks to affine mappings and modulo operations, reusing memory locations when they contain a value not used later. We describe the algorithms needed to implement such a strategy. Our implementation has two parts. The fi rst part, Bee, uses the source-to-source transformer ROSE to extract from the program all necessary information on the lifetime of array elements and to generate the code after memory reduction. The second part is a stand-alone mathematical tool dedicated to optimizations on polyhedra, in particular th...

Extracted data

Related items

Lattice-Based Array Contraction: From Theory to Practice
  • Alias, Christophe
  • Darte, Alain
  • Baray, Fabrice
November 2007

We build on prior work on intra-array memory reuse, for which a general theoretical framework was pr...

Bee+Cl@k: An Implementation of Lattice-Based Array Contraction in the Source-to-Source Translator ROSE
  • Alias, Christophe
  • Baray, Fabrice
  • Darte, Alain
June 2007

International audienceWe build on prior work on intra-array memory reuse, for which a general theore...

Lattice-Based Memory Allocation
  • Darte, Alain
  • Schreiber, Rob
  • Villard, Gilles
April 2004

We investigate the technique of storing multiple array elements in the same memory cell, with the go...

We use cookies to provide a better user experience.