Decomposability, instabilities, and saturation in multiprogramming systems
Communications of the ACM
A simple linear model of demand paging performance
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
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
Using page residency to select the working set parameter
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
Operating system principles
A study of program locality and lifetime functions
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
A model of performance for virtual memory systems
SIGMETRICS '74 Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation
Determining an Optimal Secondary Storage Service Rate for the PASM Control System
IEEE Transactions on Computers
An Approach to Program Behavior Modeling and Optimal Memory Control
Journal of the ACM (JACM)
Approximate Methods for Analyzing Queueing Network Models of Computing Systems
ACM Computing Surveys (CSUR)
ACM Forum: memory management modeling
Communications of the ACM
Survey of recent operating systems research, designs and implementations
ACM SIGOPS Operating Systems Review
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
Converting a swap-based system to do paging in an architecture lacking page-referenced bits
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
| Hi-index | 0.02 |
Balancing interpagefault lifetime (L) against page swap time (S) has always been a performance criterion of great intuitive appeal. This paper shows that, under normal conditions, controlling the memory policy parameter to enforce the constraint L ≥ S, and allowing the multiprogramming load to rise as high as demand warrants without violating this constraint, will produce a load slightly higher than optimum. Equivalently, using the criterion L &equil; uS for some u slightly larger than 1 will approximate an optimal load. Using simulations, this criterion is compared with two others reported in the literature, namely the “knee criterion” (operate with L at the knee of the lifetime curve) and the 50% criterion (operate with the paging device at 50% utilization).The knee criterion produced optimal loads more often than the L&equil;S criterion, which in turn produced optimal loads more often than the 50% criterion. Since no practical implementation of the knee criterion is known, the L&equil;S criterion is the most attractive of the three.