Mapping model with Inter-array memory sharing for multidimensional signal processing

The storage requirements in data-intensive signal processing systems (including applications in video and image processing, artificial vision, medical imaging, real-time 3-D rendering, advanced audio and speech coding) have an important impact on both the system performance and the essential design parameters -- the overall power consumption and chip area. This is due to the significant amount of data that must be stored during the execution of the algorithmic specification, as well as due to the amount of data transfers to/from large, energy-consuming, off-chip data memories. This paper addresses the problem of efficiently mapping the multidimensional signals from the algorithmic specification of the system into the physical memory. Different from all the previous mapping models that aim to optimize the memory sharing between the elements of a same array, creating separate windows in the physical memory for distinct arrays, this proposed mapping model is the first one to exploit the possibility of memory sharing between different arrays. As a consequence, this signal-to-memory mapping approach yields significant savings in the amount of data storage resulted after mapping.

[1]  Paul Feautrier,et al.  Automatic Storage Management for Parallel Programs , 1998, Parallel Comput..

[2]  J. Edmonds Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[3]  Gerda Janssens,et al.  Storage Size Reduction by In-place Mapping of Arrays , 2002, VMCAI.

[4]  Francky Catthoor,et al.  Data dependency size estimation for use in memory optimization , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Joos Vandewalle,et al.  In-place memory management of algebraic algorithms on application specific ICs , 1991, J. VLSI Signal Process..

[6]  Florin Balasa,et al.  Computation of Storage Requirements for Multi-Dimensional Signal Processing Applications , 2007, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[7]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Harold Neil Gabow,et al.  Implementation of algorithms for maximum matching on nonbipartite graphs , 1973 .

[9]  Hugo De Man,et al.  Memory Size Reduction Through Storage Order Optimization for Embedded Parallel Multimedia Applications , 1997, Parallel Comput..

[10]  Robert E. Tarjan,et al.  Faster scaling algorithms for general graph matching problems , 1991, JACM.

[11]  Gilles Villard,et al.  Lattice-based memory allocation , 2003, IEEE Transactions on Computers.

[12]  Sanjay V. Rajopadhye,et al.  Optimizing memory usage in the polyhedral model , 2000, TOPL.

[13]  David K. Smith Theory of Linear and Integer Programming , 1987 .

[14]  Florin Balasa,et al.  Signal-to-Memory Mapping Analysis for Multimedia Signal Processing , 2007, 2007 Asia and South Pacific Design Automation Conference.