Affiliation:
1. Department of Computer Studies, University of Lancaster, Bailrigg, Lancaster, LA1 4YN, England
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Nearly Quadratic Improvement for Memory Reallocation;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
2. The Unexpected Efficiency of Bin Packing Algorithms for Dynamic Storage Allocation in the Wild: An Intellectual Abstract;Proceedings of the 2023 ACM SIGPLAN International Symposium on Memory Management;2023-06-06
3. Dynamic memory management in massively parallel systems;Proceedings of the 36th ACM International Conference on Supercomputing;2022-06-28
4. References;Network Algorithmics;2022
5. Prefix-match lookups;Network Algorithmics;2022