Lattice-based memory allocation

CASES 2003: International Conference on Compilers, Architecture, and Synthesis for Embedded Systems

Volumn , Issue , 2003, Pages 298-308

  Darte, Alain ^a   Schreiber, Rob ^b   Villard, Gilles ^a  

^a UNIV LYON   (France)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Admissible lattice; Critical determinant; Memory allocation; Program transformation; Successive minima

Indexed keywords

APPLICATION SPECIFIC INTEGRATED CIRCUITS; ARRAYS; EMBEDDED SYSTEMS; PROBLEM SOLVING; PROGRAM COMPILERS; SCHEDULING;

ADMISSIBLE LATTICE; CRITICAL DETERMINANT; PROGRAM TRANSFORMATION; SUCCESSIVE MINIMA;

STORAGE ALLOCATION (COMPUTER);

EID: 18844452627     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/951710.951749     Document Type: Conference Paper

References (23)

1. S. Aditya and M. S. Schlansker. Shiftq: A buffered interconnect for custom loop accelerators. In International Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES'01), pages 158-167, Atlanta, USA, 2001. ACM Press.
2. A. Darte, M. Dion, and Y. Robert. A characterization of one-to-one modular mappings. Parallel Processing Letters, 5(1):145-157, 1996.
3. A. Darte, R. Schreiber, B. R. Rau, and F. Vivien. Constructing and exploiting linear schedules with prescribed parallelism. ACM Transactions on Design Automation of Electronic Systems, 7(1):159-172, 2002.
4. A. Darte, F. Vivien, and Y. Robert. Scheduling and Automatic Parallelization. Birkhäuser, Boston, 2000.
5. C. Dwork. Lattices and their application to cryptography. Available as lecture notes http://theory.stanford.edu/~csilvers/cs359/, 1998.
6. F. Catthoor. et al. Atomium: A toolbox for optimising memory I/O using geometrical models. http://www.imec.be/design/atomium/.
7. P. Feautrier. Data flow analysis of scalar and array references. International Journal of Parallel Programming, 20(1):23-53, 1991.
8. E. De Greef, F. Catthoor, and H. De Man. Memory size reduction through storage order optimization for embedded parallel multimedia applications. Parallel Computing, 23:1811-1837, 1997.
9. P. M. Gruber. Geometry of numbers. In P. Gruber and J. Wills, editors, Handbook of Convex Geometry, volume B, chapter 3.1, pages 739-763. Elsevier Science Publishers B.V., 1993.
10. P. M. Gruber and C. G. Lekkerkerker. Geometry of Numbers. North Holland, second edition, 1987.
11. L. Hafer. The generalized basis reduction algorithm (annotated), http://www.es.sfu.ca/~lou/MITACS/grb.pdf, June 2000.
12. V. Kathail, S. Aditya, R. Schreiber, B. R. Rau, D. C. Cronquist, and M. Sivaraman. PICO: Automatically designing custom computers. IEEE Computer, 35(9):39-47, Sept. 2002.
13. B. Kienhuis, E. Rijpkema, and E. F. Deprettere Compaan: Deriving process networks from Matlab for embedded signal processing architectures. In 8th International Workshop on Hardware/Software Codesign (CODES'00), San Diego, May 2000.
14. J. C. Lagarias. Point lattices. In R. Graham, M. Grötschel, and L. Lovász, editors, Handbook of Combinatorics, volume I, chapter 19, pages 919-966. Elsevier Science Publishers B.V., 1995.
15. V. Lefebvre and P. Feautrier. Automatic storage management for parallel programs. Parallel Computing, 24:649-671, 1998.
16. L. Lovász. An Algorithmic Theory of Numbers, Graphs, and Convexity, volume 50 of CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM, 1986.
17. L. Lovász and H. E. Scarf. The generalized basis reduction algorithm. Mathematics of Operations Research, 17(3):751-764, 1992.
18. M. Newman. Integral Matrices. Academic Press, 1972.
19. F. Quilleré and S. Rajopadhye. Optimizing memory usage in the polyhedral model. ACM Transactions on Programming Languages and Systems, 22(5):773-815, 2000.
20. P. Quinton, S. Rajopadhye, T. Risset, et al. Alpha homepage: A language dedicated to the synthesis of regular architectures, http://www.irisa.fr/cosi/.
21. M. M. Strout, L. Carter, J. Ferrante, and B. Simon. Schedule-independent storage mapping for loops. In 8th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'98), pages 24-33, San Jose, USA, 1998. ACM Press.
22. W. Thies, F. Vivien, J. Sheldon, and S. Amarasinghe. A unified framework for schedule and storage optimization. In International Conference on Programming Language Design and Implementation (PLDI'Ol), pages 232-242. ACM Press, 2001.
23. A. Turjan and B. Kienhuis. Storage management in process networks using the lexicographically maximal preimage. In 14th International Conference on Application-specific Systems, Architectures and Processors (ASAP '03), The Hague, The Netherlands, June 2003. IEEE Computer Society Press.