Bee+Cl@k: an implementation of lattice-based array contraction in the source-to-source translator rose

@inproceedings{Alias2007BeeClkAI,
  title={Bee+Cl@k: an implementation of lattice-based array contraction in the source-to-source translator rose},
  author={Christophe Alias and Fabrice Baray and Alain Darte},
  booktitle={LCTES},
  year={2007}
}
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… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Lekkerkerker. Geometry of Numbers

  • C.G.P.M. Gruber
  • North Holland, second edition,
  • 1987
Highly Influential
2 Excerpts

Similar Papers

Loading similar papers…