Worst case performance of weighted buddy systems

DOI10.1007/BF00263294MaRDI QIDQ1085608zbMATH OpenFDO

Authors Shyamal K. Chowdhury, Pradip K. Srimani

Publication date 1987

Published in Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

allocationmemory management

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Review text

In this paper the authors have studied the worst case performance of the weighted buddy system of memory management. Specifically they have derived lower bounds of two system parameters NETREQ and NETALLOC (these two parameters completely characterize both external and internal fragmentation in the system for any memory management scheme) for a weighted buddy system in case of unrestricted request sequence and stated a few preliminary results for those parameters in case of allocation only request sequence. They have also given bounds for the same system parameters for exact-fit memory manamegent algorithms to compare the results with those for buddy systems.

Recommendations

• On the worst case performance of buddy systems
• Worst case performance analysis of the two dimensional binary buddy system^∗
• Fast allocation and deallocation with an improved buddy system
• Buddy Algorithms
• A high performance memory allocator for object-oriented systems

Cited in

(5)

• On the worst case performance of buddy systems
• Fast allocation and deallocation with an improved buddy system
• Worst case performance analysis of the two dimensional binary buddy system^∗
• Buddy Algorithms
• A high performance memory allocator for object-oriented systems

This page was built for publication: Worst case performance of weighted buddy systems

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