Mapping Multi-Dimensional Signals into Hierarchical Memory Organizations
- 1 April 2007
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The storage requirements of the array-dominated and loop-organized algorithmic specifications running on embedded systems can be significant. Employing a data memory space much larger than needed has negative consequences on the energy consumption, latency, and chip area. Finding an optimized storage of the usually large arrays from these algorithmic specifications is an important step during memory allocation. This paper proposes an efficient algorithm for mapping multi-dimensional arrays to the data memory. Similarly presented in R. Toncon et al., 2002, it computes bounding windows for live elements in the index space of arrays, but this algorithm is several times faster. Moreover, since this algorithm works not only for entire arrays, but also parts of arrays-like, for instance, array references or, more general, sets of array elements represented by lattices (Schrijver, 1986), this signal-to-memory mapping technique can be also applied in multi-layer memory hierarchiesKeywords
This publication has 11 references indexed in Scilit:
- Layer Assignment Techniques for Low Energy in Multi-Layered Memory OrganizationsPublished by Springer Science and Business Media LLC ,2007
- Memory size computation for multimedia processing applicationsPublished by Association for Computing Machinery (ACM) ,2006
- Lattice-Based Memory AllocationIEEE Transactions on Computers, 2005
- Experiences with Enumeration of Integer Projections of Parametric PolytopesLecture Notes in Computer Science, 2005
- Storage Size Reduction by In-place Mapping of ArraysLecture Notes in Computer Science, 2002
- Automatic storage management for parallel programsParallel Computing, 1998
- Custom Memory Management MethodologyPublished by Springer Science and Business Media LLC ,1998
- A practical algorithm for exact array dependence analysisCommunications of the ACM, 1992
- Compiler Techniques for Massive Parallel ArchitecturesPublished by Springer Science and Business Media LLC ,1992
- Fourier-Motzkin elimination and its dualJournal of Combinatorial Theory, Series A, 1973