Fast allocation and deallocation with an improved buddy system
From MaRDI portal
Publication:1772105
DOI10.1007/s00236-004-0159-6zbMath1067.68049OpenAlexW2172568734MaRDI QIDQ1772105
Gerth Stølting Brodal, J. Ian Munro, Erik D. Demaine
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
Related Items (3)
Online Tree Node Assignment with Resource Augmentation ⋮ Constant-competitive tree node assignment ⋮ Online tree node assignment with resource augmentation
Cites Work
- On the worst case performance of buddy systems
- Worst case performance of weighted buddy systems
- A class of dynamic memory allocation algorithms
- A weighted buddy method for dynamic storage allocation
- Buddy systems
- Internal Fragmentation in a Class of Buddy Systems
- A fast storage allocator
- Statistical Properties of the Buddy System
This page was built for publication: Fast allocation and deallocation with an improved buddy system