Bounds for Some Functions Concerning Dynamic Storage Allocation
- 1 July 1974
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 21 (3), 491-499
- https://doi.org/10.1145/321832.321846
Abstract
The amount of store necessary to operate a dynamic storage allocation system, subject to certain constraints, with no risk of breakdown due to storage fragmentation, is considered. Upper and lower bounds are given for this amount of store, both of them stronger than those established earlier. The lower bound is the exact solution of a related problem concerning allocation of blocks whose size is always a power of 2.Keywords
This publication has 2 references indexed in Scilit:
- An Estimate of the Store Size Necessary for Dynamic Storage AllocationJournal of the ACM, 1971
- A fast storage allocatorCommunications of the ACM, 1965