On the worst case performance of buddy systems
From MaRDI portal
Publication:1060010
DOI10.1007/BF00288778zbMath0567.68022MaRDI QIDQ1060010
Errol L. Lloyd, Michael C. Loui
Publication date: 1985
Published in: Acta Informatica (Search for Journal in Brave)
Related Items (2)
Worst case performance analysis of the two dimensional binary buddy system∗ ⋮ Fast allocation and deallocation with an improved buddy system
Cites Work
- Minimizing access pointers into trees and arrays
- Simulations among multidimensional Turing machines
- A dynamic storage allocation problem
- Optimal Dynamic Embedding of Trees into Arrays
- 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
- Bounds for Some Functions Concerning Dynamic Storage Allocation
- A fast storage allocator
- Statistical Properties of the Buddy System
- An Estimate of the Store Size Necessary for Dynamic Storage Allocation
This page was built for publication: On the worst case performance of buddy systems
