Anomalies with variable partition paging algorithms
Communications of the ACM
Generalized working sets for segment reference strings
Communications of the ACM
MIN—an optimal variable-space page replacement algorithm
Communications of the ACM
Decomposability, instabilities, and saturation in multiprogramming systems
Communications of the ACM
The working set model for program behavior
Communications of the ACM
Operating Systems Theory
A Modified Working Set Paging Algorithm
IEEE Transactions on Computers
IEEE Transactions on Software Engineering
Thrashing: its causes and prevention
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
The page fault frequency replacement algorithm
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
Evaluation techniques for storage hierarchies
IBM Systems Journal
A method for transparent admission control and request scheduling in e-commerce web sites
Proceedings of the 13th international conference on World Wide Web
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
| Hi-index | 0.00 |
Pressures to use virtual memory are growing. Newer versions of application programs are growing explosively; for example, Microsoft Word, around 400K bytes in Version 3, is 25 megabytes in Version 6. Servers such as those running Windows NT use multiprogramming to share memory among jobs. We may see soon a revival of interest in the theory of multiprogramming as server administrators discover and worry about preventing thrashing. It is therefore useful to unearth the findings of the 1970s, which may be of interest to operating system designers and system administrators of the 1990s. How might one construct a self-regulating multiprogrammed virtual memory operating system that delivers near-optimal throughput? Such a system would necessarily not thrash. This is a hard problem. It is not obvious which design possibilities help solve the problem and are efficient to implement.