Buddy systems
- 1 June 1977
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 20 (6) , 421-431
- https://doi.org/10.1145/359605.359626
Abstract
Two algorithms are presented for implementing any of a class of buddy systems for dynamic storage allocation. Each buddy system corresponds to a set of recurrence relations which relate the block sizes provided to each other. Analyses of the internal fragmentation of the binary buddy system, the Fibonacci buddy system, and the weighted buddy system are given. Comparative simulation results are also presented for internal, external, and total fragmentation.Keywords
This publication has 8 references indexed in Scilit:
- A simplified recombination scheme for the Fibonacci buddy systemCommunications of the ACM, 1975
- A weighted buddy method for dynamic storage allocationCommunications of the ACM, 1974
- Dynamic memory allocation systems for minimizing internal fragmentationPublished by Association for Computing Machinery (ACM) ,1974
- A class of dynamic memory allocation algorithmsCommunications of the ACM, 1973
- Analysis of free-storage algorithmsIBM Systems Journal, 1971
- Statistical Properties of the Buddy SystemJournal of the ACM, 1970
- A fast storage allocatorCommunications of the ACM, 1965
- A Generalization of Fibonacci NumbersThe Fibonacci Quarterly, 1964