Abstract
Programs for embedded multimedia applications typically manipulate several large multi-dimensional arrays. The energy consumption per access increases with their size; the access to these large arrays is responsible for a substantial part of the power consumption. In this paper, an analysis is developed to compute a bounding box for the elements in the array that are simultaneously in use. The size of the original array can be reduced to the size of the bounding box and accesses to it can be redirected using modulo operations on the original indices. This substantially reduces the size of the memories and the power consumption of accessing them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Berkelaar. Lp_solve Mixed Integer Linear Programming solver 2.0. Available at ftp://ftp.es.ele.tue.nl/pub/lp_solve, 1995.
Francky Catthoor, Sven Wuytack, Eddy De Greef, Florin Balasa, Lode Nachtergale, and Arnout Vandecapelle. Custom Memory Management Methodology: Exploration of Memory Organisation for Embedded Multimedia Design. Kluwer Academic Publishers, 1998.
E. De Greef, F. Catthoor, and H. De Man. Reducing storage size for static control programs mapped onto parallel architectures. In Proceedings of Dagstuhl Seminar on Loop Parallelization, 1996.
E. De Greef, F. Catthoor, and H. De Man. Memory size reduction through storage order optimization for embedded parallel multimedia applications. In Proceedings of the Workshop on Parallel Processing and Multimedia of the International Parallel Processing Symposium, pages 84–98, 1997.
Eddy De Greef. Storage Size Reduction for Multimedia Applications. PhD thesis, Katholieke Universiteit Leuven, Faculteit Toegepaste Wetenschappen, Jan 1998.
Saumya K. Debray. On copy avoidance in single assignment languages. In David S. Warren, editor, Proceedings of the Tenth International Conference on Logic Programming, pages 393–407. The MIT Press, 1993.
P. Feautrier. Dataflow analysis of array and scalar references. International Journal of Parallel Programming, 20(1):23–53, 1991.
Gudjón Gudjónsson and William H. Winsborough. Compile-time memory reuse in logic programming languages through update in place. ACM Transactions on Programming Languages and Systems, 21(3):430–501, May 1999.
Christian Holzbaur. OFAI clp(q,r) Manual, Edition 1.3.3. Austrian Research Institute for Artificial Intelligence, Vienna, TR-95-09, 1995.
V. Lefebvre and P. Feautrier. Optimizing storage size for static control programs in automatic parallelizers. In Proc. EuroPar Conference, Passau, Germany, volume 1300 of LNCS, pages 356–363. Springer Verlag, Aug. 1997.
Nancy Mazur, Gerda Janssens, and Maurice Bruynooghe. A module based analysis for memory reuse in Mercury. In John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luis Moniz Pereira, Yehoshua Sagiv, and Peter J. Stuckey, editors, Computational Logic-CL 2000, UK, Proceedings, volume 1861 of LNAI, pages 1255–1269. Springer-Verlag, 2000.
Sunder Phani Kumar Nookala Nookala and Tanguy Risset. A library for doing Z-polyhedral computations. Technical Report 1330, Institut de Recherche en Informatique et Systèmes Aléatoires, May 2000.
Fabien Quilleré and Sanjay Rajopadhye. Optimizing memory usage in the polyhedral model. In Massively Parallel Computer Systems Conf., 1998.
Fabien Quilleré and Sanjay Rajopadhye. Optimizing memory usage in the polyhedral model. In ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 22, Issue 5, pages 773–815, Sept. 2000.
J. Vanhoof, I. Bolsens, and H. De Man. Compiling multi-dimensional data streams into distributed DSP ASIC memory. In Proc. IEEE Int. Conf. Comp. Aided Design, Santa Clara CA, pages 272–275, 1989.
I. Verbauwhede, F. Catthoor, J. Vandewalle, and H. De Man. Background memory management for the synthesis of algebraic algorithms on multi-processor DSP chips. In Proc. VLSI’89, Int. Conf. on VLSI, Munich, Germany, pages 209–218, 1989.
D. Wilde and S. Rajopadhye. Memory reuse analysis in the polyhedral model. In Proc. EuroPar Conference, Lyon, France, volume 1123 of LNCS, pages 389–397. Springer Verlag, 1996.
Doran K. Wilde. A library for doing polyhedral computations. Technical Report 785, Institut de Recherche en Informatique et Systèmes Aléatoires, December 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tronçon, R., Bruynooghe, M., Janssens, G., Catthoor, F. (2002). Storage Size Reduction by In-place Mapping of Arrays. In: Cortesi, A. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2002. Lecture Notes in Computer Science, vol 2294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47813-2_12
Download citation
DOI: https://doi.org/10.1007/3-540-47813-2_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43631-7
Online ISBN: 978-3-540-47813-3
eBook Packages: Springer Book Archive