Buddy Systems (1974)
by
James L. Peterson
,
Theodore A. Norman
| Venue: | Communications of the ACM |
| Citations: | 35 - 0 self |
BibTeX
@ARTICLE{Peterson74buddysystems,
author = {James L. Peterson and Theodore A. Norman},
title = {Buddy Systems},
journal = {Communications of the ACM},
year = {1974},
volume = {20},
pages = {421--431}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 buddysystem, the Fibonai buddy system, and the weighted buddy system are given. Comparative simulation results are also presented for internal, external and total fragmentation.
Citations
| 59 | Fast Storage Allocator - Knowlton - 1965 |
| 11 | A class of dynamic memory allocation algorithms - Hirschberg - 1973 |
| 11 | Analysis of free-storage algorithms - Margolin, Parmelee, et al. - 1971 |
| 10 | A weighted buddy method for dynamic storage allocation - Shen, Peterson - 1974 |
| 9 | S.M.: Statistical properties of the buddy system - Jr, Stigler - 1970 |
| 9 | Internal fragmentation in a class of buddy systems - Russell |
| 7 | A simplied recombination scheme for the Fibonacci buddy system - Cranston, Thomas - 1975 |
| 3 | On a generalization of the Fibonacci numbers useful in memory allocation schema. The Fibonacci Quarterly - Ferguson - 1976 |
| 2 | Zo Dynamic memory allocation systems for minimizing internal fragmentation - Lewis, Smith, et al. - 1974 |
| 1 | A generalization of Fibonacci numbers - Harris, Styles - 1964 |
| 1 | The Art of Computer Prosramming, Volume 1: Fundamental A18orihms - Knuth - 1968 |
| 1 | Tailored buddy systems for dynamic stocage allocation - Norman - 1975 |
