Variations on the binary buddy system for dynamic memory management

Authors:
Arie Kaufman
Affiliations:
Florida International University, Miami, Florida
Venue:
ACM-SE 18 Proceedings of the 18th annual Southeast regional conference
Year:
1980

Citing 7
Cited 1

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Buddy systems

Communications of the ACM
A weighted buddy method for dynamic storage allocation

Communications of the ACM
A class of dynamic memory allocation algorithms

Communications of the ACM
A fast storage allocator

Communications of the ACM
Data Structures and PL-1 Programming

Data Structures and PL-1 Programming
System design and implementation of BGRAF2

SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques

Tailored-List and Recombination-Delaying Buddy Systems

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two new variations of the binary buddy system for dynamic storage bookkeeping are introduced. These variations, the revised buddy system and the tailored-lists buddy system, recombine smaller memory blocks only upon necessity in an attempt to save on processor execution time. Simulation results comparing the three systems reveal that the two new variations are superior to the original buddy system, since they are faster and the difference in memory utilization is insignificant. A comparison of the revised system and the tailored-lists system indicates that they are equal in performance.