Summary
Methods are presented for the estimation of bounds on the memory fragmentation in buddy methods of dynamic storage allocation. These bounds, when compared with the results of simulation studies, are found to be sufficiently precise to be of considerable practical utility.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bromley AG (1976) An improved buddy method for dynamic storage allocation, Proc 7th Aust Comp Conf, 708–715
Hinds JA (1975) An algorithm for locating adjacent storage blocks in the buddy system, Comm ACM 18: 221–222
Hirschberg DS (1973) A class of dynamic storage allocation algorithms. Comm ACM 16: 615–618
Knowlton KC (1965) A fast storage allocator. Comm. ACM 8:623–625
Knuth DE (1968) The art of computer programming, Vol. 1, Addison-Wesley, Reading, MA, p 435
Shen KK, Peterson JL (1974) A weighted buddy method for dynamic storage allocation, Comm ACM 17: 558–562; and 18: 202.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bromley, A.G. Memory fragmentation in buddy methods for dynamic storage allocation. Acta Informatica 14, 107–117 (1980). https://doi.org/10.1007/BF00288539
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00288539