Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Bee+Cl@k: An Implementation of Lattice-Based Array Contraction in the Source-to-Source Translator ROSE
 

Summary: Bee+Cl@k: An Implementation of Lattice-Based Array
Contraction in the Source-to-Source Translator ROSE
Christophe Alias Fabrice Baray Alain Darte
LIP, CNRS ­ ENS Lyon ­ UCB Lyon ­ INRIA, France
Firstname.Lastname@ens-lyon.fr
Abstract
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 first 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, Cl@k, is a stand-alone mathematical tool
dedicated to optimizations on polyhedra, in particular the
computation of successive minima and the computation of

  

Source: Alias, Christophe - INRIA & Laboratoire de l'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon

 

Collections: Computer Technologies and Information Sciences