Affiliation:
1. Computer Sciences Department, University of Wisconsin-Madison
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. LPR;Proceedings of the 23rd International Middleware Conference Industrial Track;2022-11-07
2. Adaptive Page Migration Policy With Huge Pages in Tiered Memory Systems;IEEE Transactions on Computers;2022-01-01
3. LIRS2;Proceedings of the 14th ACM International Conference on Systems and Storage;2021-06-14
4. APR: adaptive page replacement scheme for scientific applications;Cluster Computing;2021-05-11
5. An adaptive page replacement scheme for scientific applications;2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems Companion (ACSOS-C);2020-08