Principles of Optimal Page Replacement
Journal of the ACM (JACM)
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 working set model for program behavior
Communications of the ACM
Experimental data on how program behavior affects the choice of scheduler parameters
SOSP '71 Proceedings of the third ACM symposium on Operating systems principles
On the Design of Bayesian Storage Allocation Algorithms for Paging and Segmentation
IEEE Transactions on Computers
Scheduling TSS/360 for responsiveness
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
An Empirical Study of Task Switching Locality in MVS
IEEE Transactions on Computers
Measuring Benchmark Similarity Using Inherent Program Characteristics
IEEE Transactions on Computers
A Modified Working Set Paging Algorithm
IEEE Transactions on Computers
Working Set and Page Fault Frequency Paging Algorithms: A Performance Comparison
IEEE Transactions on Computers
Experimental data on page replacement algorithm
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
Effect of replacement algorithms on a paged buffer database system
IBM Journal of Research and Development
Model for interactive data base reference string
IBM Journal of Research and Development
Optimal control of demand-paging systems
Information Sciences: an International Journal
First-in not referenced first-out page replacement algorithm
Proceedings of the International Conference & Workshop on Emerging Trends in Technology
Dynamic adaptive scheduling for virtual machines
Proceedings of the 20th international symposium on High performance distributed computing
Optimal eviction policies for stochastic address traces
Theoretical Computer Science
| Hi-index | 0.01 |
For many years, there has been interest in "program locality" as a phenomenon to be considered in storage allocation. This notion arises from the empirical observation that it is possible to run a program efficiently with only some fraction of its total instruction and data code in main storage at any given time. That virtual memory systems can be made to run at all demonstrates that program locality can be used to advantage; and though it is certainly possible to write a program which violates the principles of locality, it seems one must go out of one's way to do so.