Principles of Optimal Page Replacement
Journal of the ACM (JACM)
Decomposability, instabilities, and saturation in multiprogramming systems
Communications of the ACM
The design, implementation, and evaluation of a working set dispatcher
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
PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
Principles of optimality for multiprogramming
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
An L=S criterion for optimal multiprogramming
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
A study of program locality and lifetime functions
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
WSCLOCK—a simple and effective algorithm for virtual memory management
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
Dynamic Programming
BI batch manager: a system for managing batch workloads on enterprise data-warehouses
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Steady state approximations of limited processor sharing queues in heavy traffic
Queueing Systems: Theory and Applications
Self-adaptive admission control policies for resource-sharing systems
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Law of Large Number Limits of Limited Processor-Sharing Queues
Mathematics of Operations Research
| Hi-index | 0.00 |
The method of discrete optimal control is applied to control thrashing in a virtual memory. Certain difficulties with several previous approaches are discussed. The mechanism of optimal control is presented as an effective, inexpensive alternative. A simple, ideal policy is devised to illustrate the method. A new feedback parameter, the thrashing level, is found to be a positive and robust indicator of thrashing. When applied to a real system, the idealized policy effectively controlled the virtual memory.