Principles of Optimal Page Replacement
Journal of the ACM (JACM)
Finding Optimal Demand Paging Algorithms
Journal of the ACM (JACM)
A Survey of Analytical Time-Sharing Models
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Attribute based file organization in a paged memory environment
Communications of the ACM
The design, implementation, and evaluation of a working set dispatcher
Communications of the ACM
Empirical working set behavior
Communications of the ACM
Multiple terminals under user program control in a time-sharing environment
Communications of the ACM
Using page residency to select the working set parameter
Communications of the ACM
RESOURCE ALLOCATION IN MULTIPROCESS COMPUTER SYSTEMS
RESOURCE ALLOCATION IN MULTIPROCESS COMPUTER SYSTEMS
ACM SIGMETRICS Performance Evaluation Review
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
Analytic modelling of “working set like” replacement algorithms
SIGMETRICS '79 Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems
A performance measurement and system evaluation project plan proposal
ACM SIGMETRICS Performance Evaluation Review
| Hi-index | 0.00 |
The concept of varying window size in a working set dispatcher to control working set size and number of page faults is examined. A space-time cost equation is developed and used to compare fixed window size to variable window size for different types of secondary storage based on the simulated execution of real programs. A general approach is indicated for studying the relative merit of the two dispatching algorithms and their interaction with different hardware configurations.