Real-time performance of dynamic memory allocation algorithms
- 25 June 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Dynamic memory management is an important aspect of modern software engineering techniques. However, developer of real-time systems avoid using it because they fear that the worst-case execution time of the dynamic memory allocation routines is not bounded or is bounded with an excesively large bound. The degree to which this concern is valid is quantified in this paper, by giving detailed average and worst-case measurements of the timing performance of a comprehensive panel of dynamic memory allocator .For each allocator, we compare it worst-case behavior obtained analytically with the worst timing behavior observed by executing real and synthetic workloads, and with its average timing performance. The results provide a guideline to developer of real-time systems to choose whether to use dynamic memory management or not, and which dynamic allocation algorithm should be preferred from the viewpoint of predictability.Keywords
This publication has 12 references indexed in Scilit:
- Statistical analysis of WCET for schedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The real-time behavior of dynamic memory management in C++Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Deriving annotations for tight calculation of execution timePublished by Springer Nature ,1997
- Memory system performance of programs with intensive heap allocationACM Transactions on Computer Systems, 1995
- Evaluating models of memory allocationACM Transactions on Modeling and Computer Simulation, 1994
- An efficient algorithm for heap storage allocationACM SIGPLAN Notices, 1988
- On the worst case performance of buddy systemsActa Informatica, 1985
- New methods for dynamic storage allocation (Fast Fits)Published by Association for Computing Machinery (ACM) ,1983
- A unifying look at data structuresCommunications of the ACM, 1980
- Worst case fragmentation of first fit and best fit storage allocation strategiesThe Computer Journal, 1977