On the worst case performance of buddy systems

DOI10.1007/BF00288778MaRDI QIDQ1060010zbMATH OpenFDO

Authors Errol L. Lloyd, Michael C. Loui

Publication date 1985

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00288778

zbMATH Keywords

Fibonacci buddy systemsmemory managementstorage allocationworst-case performance

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Review text

The worst-case performance of both binary and Fibonacci buddy systems is analyzed. For both unrestricted and allocation-only request sequences, exact bounds on both the external and total fragmentation are derived.

Recommendations

• Worst case performance of weighted buddy systems
• Worst case performance analysis of the two dimensional binary buddy system^∗
• Fast allocation and deallocation with an improved buddy system
• Buddy Algorithms
• Algorithms for resolving conflicts in dynamic storage allocation

Cites work

• A class of dynamic memory allocation algorithms
• A dynamic storage allocation problem
• A fast storage allocator
• A weighted buddy method for dynamic storage allocation
• An Estimate of the Store Size Necessary for Dynamic Storage Allocation
• Bounds for Some Functions Concerning Dynamic Storage Allocation
• Buddy systems
• Internal Fragmentation in a Class of Buddy Systems
• Minimizing access pointers into trees and arrays
• Optimal Dynamic Embedding of Trees into Arrays
• Simulations among multidimensional Turing machines
• Statistical Properties of the Buddy System

Cited in

(4)

• Worst case performance of weighted buddy systems
• Fast allocation and deallocation with an improved buddy system
• Worst case performance analysis of the two dimensional binary buddy system^∗
• Buddy Algorithms

This page was built for publication: On the worst case performance of buddy systems

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