A study of storage partitioning using a mathematical model of locality
Communications of the ACM
Properties of the working-set model
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
Dynamic space-sharing in computer systems
Communications of the ACM
The working set model for program behavior
Communications of the ACM
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
Program locality and dynamic memory management.
Program locality and dynamic memory management.
Program reference behavior and dynamic memory management.
Program reference behavior and dynamic memory management.
The page fault frequency replacement algorithm
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Experiments with program locality
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Experimental data on page replacement algorithm
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
Empirically derived micromodels for sequences of page exceptions
IBM Journal of Research and Development
Generalized ERSS tree model: Revisiting working sets
Performance Evaluation
| Hi-index | 14.98 |
Performance of a paged virtual memory computer system operating under working set (WS) and page fault frequency (PFF) paging algorithms is analyzed analytically. Performance sensitivity to program reference behavior and paging algorithm parameter is studied for the two paging algorithms. The results indicate that when performance with the two algorithms is compared, the WS algorithm is generally less sensitive to changes in program behavior. Results are also provided relating to performance sensitivity to algorithm parameter selection.