A weighted buddy method for dynamic storage allocation
- 1 October 1974
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 17 (10) , 558-562
- https://doi.org/10.1145/355620.361164
Abstract
An extension of the buddy method, called the weighted buddy method, for dynamic storage allocation is presented. The weighted buddy method allows block sizes of 2 k and 3·2 k , whereas the original buddy method allowed only block sizes of 2 k . This extension is achieved at an additional cost of only two bits per block. Simulation results are presented which compare this method with the buddy method. These results indicate that, for a uniform request distribution, the buddy system has less total memory fragmentation than the weighted buddy algorithm. However, the total fragmentation is smaller for the weighted buddy method when the requests are for exponentially distributed block sizes.Keywords
This publication has 4 references indexed in Scilit:
- A class of dynamic memory allocation algorithmsCommunications of the ACM, 1973
- Statistical Properties of the Buddy SystemJournal of the ACM, 1970
- A note on storage fragmentation and program segmentationCommunications of the ACM, 1969
- A fast storage allocatorCommunications of the ACM, 1965