An algorithm for drum storage management in time-sharing systems

Authors:
Mark L. Greenberg
Affiliations:
-
Venue:
SOSP '71 Proceedings of the third ACM symposium on Operating systems principles
Year:
1971

Citing 2
Cited 3

Virtual Memory

ACM Computing Surveys (CSUR)
The working set model for program behavior

Communications of the ACM

Operating system performance

Communications of the ACM
An Optimal Drum Scheduling Algorithm

IEEE Transactions on Computers
On modeling program behavior

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference

Quantified Score

Hi-index	0.02

Visualization

Abstract

An algorithm for efficiently managing the transfer of pages of information between main and secondary memory is developed and analyzed. The algorithm applies to time-shared computer systems that use rotating magnetic drums as secondary storage devices. The algorithm is designed to provide efficient system performance when referenced pages are predominantly pre-loaded. However, the algorithm also provides optimum results for systems where all pages are loaded on demand. The nature of the improved performance which can be derived from page pre-loading strategy is discussed. Simulation results are presented which plot system performance as a function of main memory size.