Issue No. 04 - April (2010 vol. 59)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2009.154
Yusuf Hasan , Iowa Sate University, Ames
Wei-Mei Chen , National Taiwan University of Science and Technology, Taipei
J. Morris Chang , Iowa State University, Ames
Bashar M. Gharaibeh , Iowa State University, Ames
In this paper, we study the upper bounds of memory storage for two different allocators. In the first case, we consider a general allocator that can allocate memory blocks anywhere in the available heap space. In the second case, a more economical allocator constrained by the address-ordered first-fit allocation policy is considered. We derive the upper bound of memory usage for all allocators and present a systematic approach to search for allocation/deallocation patterns that might lead to the largest fragmentation. These results are beneficial in embedded systems where memory usage must be reduced and predictable because of lack of swapping facility. They are also useful in other types of computing systems.
Dynamic memory allocation, memory storage, storage allocation/deallocation policies, first-fit allocator, garbage collection.
W. Chen, J. M. Chang, Y. Hasan and B. M. Gharaibeh, "Upper Bounds for Dynamic Memory Allocation," in IEEE Transactions on Computers, vol. 59, no. , pp. 468-477, 2009.