An Estimate of the Store Size Necessary for Dynamic Storage Allocation
Journal of the ACM (JACM)
A comparison of next-fit, first-fit, and best-fit
Communications of the ACM
Communications of the ACM
A simplified recombination scheme for the Fibonacci buddy system
Communications of the ACM
Improved event-scanning mechanisms for discrete event simulation
Communications of the ACM
On the external storage fragmentation produced by first-fit and best-fit allocation strategies
Communications of the ACM
A weighted buddy method for dynamic storage allocation
Communications of the ACM
A class of dynamic memory allocation algorithms
Communications of the ACM
A note on storage fragmentation and program segmentation
Communications of the ACM
Communications of the ACM
Communications of the ACM
Communications of the ACM
A programmer's description of L6
Communications of the ACM
Experience in automatic storage allocation
Communications of the ACM
Symbol manipulation in FORTRAN: SASP I subroutines
Communications of the ACM
Scalability of dynamic storage allocation algorithms
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
| Hi-index | 0.00 |
Most research in free-storage management has centered around strategies that search a linked list and strategies that partition storage into predetermined sizes. Such algorithms are analyzed in terms of CPU efficiency and storage efficiency. The subject of this study is the free-storage management in the Virtual Machine/System Product (VM/SP) system control program. As a part of this study, simulations were done of established, and proposed, dynamic storage algorithms for the VM/SP operating system. Empirical evidence is given that simplifying statistical assumptions about the distribution of interarrival times and holding times has high predictive ability. Algorithms such as first-fit, modified first-fit, and best-fit are found to be CPU-inefficient. Buddy systems are found to be very fast but suffer from a high degree of internal fragmentation. A form of extended subpooling is shown to be as fast as buddy systems with improved storage efficiency. This algorithm was implemented for VM/SP, and then measured. Results for this algorithm are given for several production VM/SP systems.