Upper Bounds for Dynamic Memory Allocation

التفاصيل البيبلوغرافية
العنوان: Upper Bounds for Dynamic Memory Allocation
المؤلفون: B.M. Gharaibeh, J.M. Chang, Wei-Mei Chen, Y. Hasan
المصدر: IEEE Transactions on Computers. 59:468-477
بيانات النشر: Institute of Electrical and Electronics Engineers (IEEE), 2010.
سنة النشر: 2010
مصطلحات موضوعية: C dynamic memory allocation, Computer science, Fragmentation (computing), Dynamic priority scheduling, Parallel computing, Static memory allocation, Theoretical Computer Science, Allocator, Memory management, Computational Theory and Mathematics, Hardware and Architecture, Algorithm design, Software, Garbage collection, Heap (data structure)
الوصف: 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.
تدمد: 0018-9340
DOI: 10.1109/tc.2009.154
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::60a5327d4de1aa6ff8aa08bab8922fe8
https://doi.org/10.1109/tc.2009.154
Rights: CLOSED
رقم الانضمام: edsair.doi...........60a5327d4de1aa6ff8aa08bab8922fe8
قاعدة البيانات: OpenAIRE
الوصف
تدمد:00189340
DOI:10.1109/tc.2009.154