Analysis of free-storage algorithms-visited

Publisher Website
Google Scholar
Abstract
Most research in free-storage management has cen- tered 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 Machinelsystem Product (VMISP) system control pro- gram. As a part of this study, simulations were done of established, and proposed, dynamic storage algo- rithms for the VMISP operating system. Empirical evi- dence 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 fragmen- tation. A form of extended subpooling is shown to be as fast as buddy systems with improved storage effi- ciency. This algorithm was implemented for VMISP, and then measured. Results for this algorithm are given for several production VMISP systems.

This publication has 0 references indexed in Scilit: