On the worst case performance of buddy systems
- 1 October 1985
- journal article
- Published by Springer Science and Business Media LLC in Acta Informatica
- Vol. 22 (4), 451-473
- https://doi.org/10.1007/bf00288778
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Optimal Dynamic Embedding of Trees into ArraysSIAM Journal on Computing, 1983
- Simulations among multidimensional turing machinesTheoretical Computer Science, 1982
- Memory fragmentation in buddy methods for dynamic storage allocationActa Informatica, 1980
- Buddy systemsCommunications of the ACM, 1977
- Bounds for Some Functions Concerning Dynamic Storage AllocationJournal of the ACM, 1974
- A dynamic storage allocation problemInformation Processing Letters, 1973
- A class of dynamic memory allocation algorithmsCommunications of the ACM, 1973
- An Estimate of the Store Size Necessary for Dynamic Storage AllocationJournal of the ACM, 1971
- Statistical Properties of the Buddy SystemJournal of the ACM, 1970
- A fast storage allocatorCommunications of the ACM, 1965