Fast allocation and deallocation with an improved buddy system

DOI10.1007/S00236-004-0159-6MaRDI QIDQ1772105zbMATH OpenOpenAlexFDO

Authors Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro

Publication date 15 April 2005

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-004-0159-6

zbMATH Keywords

dynamic allocation of memory blocks

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• A simple implementation of efficient allocations
• Improved results for a memory allocation problem
• Improved Results for a Memory Allocation Problem
• scientific article; zbMATH DE number 437523
• Fast Deterministic Processor Allocation
• Efficient algorithms for dynamic allocation of distributed memory

Cites work

• A class of dynamic memory allocation algorithms
• A fast storage allocator
• A weighted buddy method for dynamic storage allocation
• Buddy systems
• Internal Fragmentation in a Class of Buddy Systems
• On the worst case performance of buddy systems
• Statistical Properties of the Buddy System
• Worst case performance of weighted buddy systems

Cited in

(9)

• Constant-competitive tree node assignment
• Buddy Algorithms
• Online tree node assignment with resource augmentation
• Algorithms for resolving conflicts in dynamic storage allocation
• Fixed-sized blocks optimization
• A high performance memory allocator for object-oriented systems
• On the worst case performance of buddy systems
• Worst case performance of weighted buddy systems
• Online Tree Node Assignment with Resource Augmentation

This page was built for publication: Fast allocation and deallocation with an improved buddy system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1772105)