Analytic modelling of “working set like” replacement algorithms

Authors:
William T. Marshall;C. Thomas Nute
Affiliations:
Department of Computer Engineering, Case Western Reserve University, Cleveland, Ohio;Department of Computer Engineering, Case Western Reserve University, Cleveland, Ohio
Venue:
SIGMETRICS '79 Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems
Year:
1979

Citing 11
Cited 1

Analysis of the PFF replacement algorithm via a semi-Markov model

Communications of the ACM
TENEX, a paged time sharing system for the PDP - 10

Communications of the ACM
Properties of the working-set model

Communications of the ACM
Demand paging through utilization of working sets onr the MANIAC II

Communications of the ACM
The design, implementation, and evaluation of a working set dispatcher

Communications of the ACM
The working set model for program behavior

Communications of the ACM
Operating Systems Theory

Operating Systems Theory
Experimental data on how program behavior affects the choice of scheduler parameters

SOSP '71 Proceedings of the third ACM symposium on Operating systems principles
An analysis of the performance of the page fault frequency (PFF) replacement algorithm.

SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
The optimal choice of window sizes for working set dispatching

SIGMETRICS '74 Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation
A unified approach to the evaluation of a class of "working set like" replacement algorithms

A unified approach to the evaluation of a class of "working set like" replacement algorithms

WSCLOCK—a simple and effective algorithm for virtual memory management

SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although a large amount of theoretical work has been performed in the analysis of the pure working set replacement algorithm, little has been done applying these results to the approximations that have been implemented. This paper presents a general technique for the analysis of these implementations by analytic methods. Extensive simulations are reported which validate the analytic model and show significant simplifications that can be made with little loss of accuracy. The problem of choosing memory policy parameter values is examined and related in a simple way to the choice of a working set window size.