Buddy Algorithms

DOI10.1093/COMJNL/30.4.308MaRDI QIDQ3799627zbMATH OpenOpenAlexFDO

Authors D. J. Challab, J. D. Roberts

Publication date 1987

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/30.4.308

zbMATH Keywords

buddy partitioningdynamic storage allocation

Mathematics Subject Classification ID

Theory of operating systems (68N25) Data structures (68P05)

Recommendations

• Fast allocation and deallocation with an improved buddy system
• Worst case performance of weighted buddy systems
• A high performance memory allocator for object-oriented systems
• On the worst case performance of buddy systems
• Algorithms for resolving conflicts in dynamic storage allocation

Cited in

(5)

• On the worst case performance of buddy systems
• Worst case performance of weighted buddy systems
• Worst case performance analysis of the two dimensional binary buddy system^∗
• scientific article; zbMATH DE number 3854406 (Why is no real title available?)
• A high performance memory allocator for object-oriented systems

This page was built for publication: Buddy Algorithms

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