The duality of memory and communication in the implementation of a multiprocessor operating system
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Competitive paging with locality of reference
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Strongly competitive algorithms for paging with locality of reference
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Application-controlled physical memory using external page-cache management
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
Working sets, cache sizes, and node granularity issues for large-scale multiprocessors
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Evaluating stream buffers as a secondary cache replacement
ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
A study of integrated prefetching and caching strategies
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Memory bandwidth limitations of future microprocessors
ISCA '96 Proceedings of the 23rd annual international symposium on Computer architecture
Studies of Windows NT performance using dynamic execution traces
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Experimental studies of access graph based heuristics: beating the LRU standard?
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Principles of Optimal Page Replacement
Journal of the ACM (JACM)
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
The Multics virtual memory: concepts and design
Communications of the ACM
The working set model for program behavior
Communications of the ACM
Operating Systems Theory
WSCLOCK—a simple and effective algorithm for virtual memory management
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
Shade: A Fast Instruction Set Simulator for Execution Profiling
Shade: A Fast Instruction Set Simulator for Execution Profiling
Managing server load in global memory systems
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Trace reduction for virtual memory simulations
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
EELRU: simple and effective adaptive page replacement
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Design and analysis of efficient application-specific on-line page replacement techniques
GLSVLSI '00 Proceedings of the 10th Great Lakes symposium on VLSI
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A fully associative software-managed cache design
Proceedings of the 27th annual international symposium on Computer architecture
FastSlim: prefetch-sfe trace reduction for I/O cache simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Dynamic Cluster Resource Allocations for Jobs with Known and Unknown Memory Demands
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
IEEE Transactions on Computers
An accurate and practical buffer allocation model for the buffer cache based on marginal gains
Information Processing Letters
Experimental Results on Statistical Approaches to Page Replacement Policies
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
TPF: a dynamic system thrashing protection facility
Software—Practice & Experience
Flexible reference trace reduction for VM simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
The EELRU adaptive replacement algorithm
Performance Evaluation
Dynamic Load Sharing With Unknown Memory Demands in Clusters
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Enabling autonomic behavior in systems software with hot swapping
IBM Systems Journal
General adaptive replacement policies
Proceedings of the 4th international symposium on Memory management
The performance impact of kernel prefetching on buffer cache replacement algorithms
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
IEEE Transactions on Computers
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
K42: an infrastructure for operating system research
ACM SIGOPS Operating Systems Review
A page fault equation for modeling the effect of memory size
Performance Evaluation
CLOCK-Pro: an effective improvement of the CLOCK replacement
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Performing replacement in modem pools
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
Reducing the disk I/O of web proxy server caches
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
An implementation study of a detection-based adaptive block replacement scheme
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
The Performance Impact of Kernel Prefetching on Buffer Cache Replacement Algorithms
IEEE Transactions on Computers
Out-of-core and compressed level set methods
ACM Transactions on Graphics (TOG)
Path: page access tracking to improve memory management
Proceedings of the 6th international symposium on Memory management
RACE: A Robust Adaptive Caching Strategy for Buffer Cache
IEEE Transactions on Computers
On adaptive replacement based on LRU with working area restriction algorithm
ACM SIGOPS Operating Systems Review
Generalized load sharing for homogeneous networks of distributed environment
Journal of Computer Systems, Networks, and Communications
Teaching page replacement algorithms with a Java-based VM simulator
Proceedings of the 14th Western Canadian Conference on Computing Education
Multi-buffer manager: Energy-efficient buffer manager for databases on flash memory
ACM Transactions on Embedded Computing Systems (TECS)
DIG: Degree of inter-reference gap for a dynamic buffer cache management
Information Sciences: an International Journal
Considering the frequency dimension into on demand adaptive algorithms
ACM SIGOPS Operating Systems Review
Dynamic cluster resource allocations for jobs with known memory demands
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Generalized load sharing for distributed operating systems
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
SieveStore: a highly-selective, ensemble-level disk cache for cost-performance
Proceedings of the 37th annual international symposium on Computer architecture
Dual-layered file cache on cc-NUMA system
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
What is a good buffer cache replacement scheme for mobile flash storage?
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Lifetime and QoS-aware energy-saving buffering schemes
Journal of Systems and Software
| Hi-index | 0.01 |
As disk performance continues to lag behind that of memory systems and processors, virtual memory management becomes increasingly important for overall system performance. In this paper we study the page reference behavior of a collection of memory-intensive applications, and propose a new virtual memory page replacement algorithm, SEQ. SEQ detects long sequences of page faults and applies most-recently-used replacement to those sequences. Simulations show that for a large class of applications, SEQ performs close to the optimal replacement algorithm, and significantly better than Least-Recently-Used (LRU). In addition, SEQ performs similarly to LRU for applications that do not exhibit sequential faulting.