Principles of Optimal Page Replacement
Journal of the ACM (JACM)
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
The working set model for program behavior
Communications of the ACM
TPF: a dynamic system thrashing protection facility
Software—Practice & Experience
Storage Access Support for Soft Real-Time Applications
RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
Token-ordered LRU: an effective page replacement policy and its implementation in Linux systems
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
Advanced memory management and disk scheduling techniques for general-purpose operating systems
Advanced memory management and disk scheduling techniques for general-purpose operating systems
Throttling On-Disk Schedulers to Meet Soft-Real-Time Requirements
RTAS '08 Proceedings of the 2008 IEEE Real-Time and Embedded Technology and Applications Symposium
Thrashing: its causes and prevention
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
NCQ vs. I/O scheduler: Preventing unexpected misbehaviors
ACM Transactions on Storage (TOS)
Hi-index | 0.00 |
The swap mechanism allows an operating system to work with more memory than available RAM space, by temporarily flushing some data to disk. However, the system sometimes ends up spending more time swapping data in and out of disk than performing actual computation. This state is called thrashing. Classical strategies against thrashing rely on reducing system load, so as to decrease memory pressure and increase global throughput. Those approaches may however be counterproductive when tricked into advantaging malicious or long-standing processes. This is particularily true in the context of shared hosting or virtualization, where multiple users run uncoordinated and selfish workloads. To address this challenge, we propose an accounting layer that forces swap fairness among processes competing for main memory. It ensures that a process cannot monopolize the swap subsystem by delaying the swap operations of abusive processes, reducing the number of system-wide page faults while maximizing memory utilization.