Automated exploration of pareto-optimal configurations in parameterized dynamic memory allocation for embedded systems

ABSTRACT

New applications in embedded systems are becoming increasingly dynamic. In addition to increased dynamism, they have massive data storage needs. Therefore, they rely heavily on dynamic, run-time memory allocation. The design and configuration of a dynamic memory allocation subsystem requires a big design effort, without always achieving the desired results. In this paper, we propose a fully automated exploration of dynamic memory allocation configurations. These configurations are fine tuned to the specific needs of applications with the use of a number of parameters. We assess the effectiveness of the proposed approach in two representative real-life case studies of the multimedia and wireless network domains and show up to 76% decrease in memory accesses and 66% decrease in memory footprint within the Pareto-optimal trade-off space.

REFERENCES

• 1: David Atienza , Stylianos Mamagkakis , Francky Catthoor , Jose M. Mendias , Dimitris Soudris, Dynamic Memory Management Design Methodology for Reduced Memory Footprint in Multimedia and Wireless Network Applications, Proceedings of the conference on Design, automation and test in Europe, p.10532, February 16-20, 2004
• 2: Paul R. Wilson , Mark S. Johnstone , Michael Neely , David Boles, Dynamic Storage Allocation: A Survey and Critical Review, Proceedings of the International Workshop on Memory Management, p.1-116, September 27-29, 1995
• 3: Emery D. Berger , Benjamin G. Zorn , Kathryn S. McKinley, Composing high-performance memory allocators, Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation, p.114-124, June 2001, Snowbird, Utah, United States
• 4: Infineon Easyport. http://www.itc-electronics.com/CD/infineon
• 5: MPEG-4. http://www.chiariglione.org/mpeg/standards/mpeg-4/mpeg-4.htm