(Enter summary)
Abstract: CLOCK is a classical cache replacement policy
dating back to 1968 that was proposed as a low-complexity
approximation to LRU. On every cache hit, the policy LRU
needs to move the accessed item to the most recently used
position, at which point, to ensure consistency and correctness,
it serializes cache hits behind a single global lock. CLOCK
eliminates this lock contention, and, hence, can support high
concurrency and high throughput environments such as virtual
memory (for example, Multics,... (Update)
Cited by: More
CLOCK-Pro: An Effective Improvement of the CLOCK Replacement - Song Jiang Performance
(Correct)
Program Context Specific Buffer Caching with AMP - Zhou, von Behren, Brewer (2005)
(Correct)
Trace-Based Analyses and Optimizations for Network Storage Servers - Ellard (2004)
(Correct)
Active bibliography (related documents): More All
1.9: CAR: Clock with Adaptive Replacement - Bansal, Modha (2004)
(Correct)
0.4: ARC: A Self-Tuning, Low Overhead Replacement Cache - Megiddo, Modha (2003)
(Correct)
0.4: USENIX Association - Fast Nd Usenix (2004)
(Correct)
Similar documents based on text: More All
0.5: Concept Decompositions for Large Sparse Text Data using.. - Dhillon, Modha (1999)
(Correct)
0.3: A Data-Clustering Algorithm On Distributed Memory Multiprocessors - Dhillon, Modha (1999)
(Correct)
0.3: Clustering Hypertext With Applications To Web Searching - Modha, Spangler (2000)
(Correct)
Related documents from co-citation: More All
4: Informed prefetching and caching
- Patterson, Gibson et al. - 1995
3: An Inter-Reference Gap Model for Temporal Locality in Program Behavior (context) - Phalke, Gopinath - 1995
3: An Implementation Study of a Detection-Based Adaptive Block Replacement Scheme
- Choi, Noh et al. - 1999
BibTeX entry: (Update)
Sorav Bansal and Dharmendra S. Modha, "CAR: Clock with Adaptive Replacement," in Proceedings of the USENIX Conference on File and Storage Technologies (FAST), pages 187--200, March 2004. http://citeseer.ist.psu.edu/article/bansal04car.html More
@misc{ bansal04car,
author = "S. Bansal and D. Modha",
title = "CAR: Clock with Adaptive Replacement",
text = "Sorav Bansal and Dharmendra S. Modha, CAR: Clock with Adaptive Replacement,
in Proceedings of the USENIX Conference on File and Storage Technologies
(FAST), pages 187--200, March 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/article/bansal04car.html" }
Citations (may not include all citations):
334
Operating System Concepts (context) - Silberschatz, Galvin - 1995
265
The Design of the UNIX Operating System (context) - Bach - 1986
232
A study of replacement algorithms for virtual storage comput.. (context) - Belady - 1966
135
Operating Systems Theory (context) - Coffman, Denning - 1973
129
Starburst mid-flight: As the dust clears (context) - Haas, Chang et al. - 1990
115
BSD Operating System (context) - McKusick, Bostic et al. - 1996
109
Operating Systems: Design and Implementation (context) - Tanenbaum, Woodhull - 1997
88
Data cache management using frequency-based replacement (context) - Robinson, Devarakonda - 1990
85
An evaluation of buffer management strategies for relational.. (context) - Chou, DeWitt - 1985
70
UNIX Internals: The New Frontiers (context) - Vahalia - 1996
34
Principles of optimal page replacement (context) - Aho, Denning et al. - 1971
34
the existence of a spectrum of policies that subsumes the le..
- Lee, Choi et al. - 1999
32
The multi-queue replacement algorithm for second level buffe..
- Zhou, Philbin - 2001
26
2Q: A low overhead high performance buffer management replac.. (context) - Johnson, Shasha - 1994
26
Second bibliography for cache memories (context) - Smith - 1991
21
The LRU-K page replacement algorithm for database disk buffe.. (context) - O'Neil, O'Neil et al. - 1993
17
LIRS: An efficient low inter-reference recency set replaceme..
- Jiang, Zhang - 2002
15
Analysis of the generalized clock buffer replacement scheme .. (context) - Nicola, Dan et al. - 1992
14
Sequentiality and prefetching in database systems (context) - Smith - 1978
12
WSClock -- a simple and effective algorithm for virtual memo.. (context) - Carr, Hennessy - 1981
10
ARC: A self-tuning, low overhead replacement cache
- Megiddo, Modha - 2003
9
Virtual memory management in the VAX/VMS operating system (context) - Levy, Lipman - 1982
7
LRFU: A spectrum of policies that subsumes the least recentl..
- Lee, Choi et al. - 2001
4
A paging experiment with the multics system (context) - Corbat - 1969
4
Bibliography on paging and related topics (context) - Smith - 1978
2
One up on LRU (context) - Megiddo, Modha - 2003
Documents on the same site (http://www.almaden.ibm.com/cs/people/dmodha/): More
Memory-Universal Prediction of Stationary Random Processes - Modha, Masry (1998)
(Correct)
A Data-Clustering Algorithm On Distributed Memory Multiprocessors - Dhillon, Modha (1999)
(Correct)
Minimum Complexity Regression Estimation with Weakly Dependent .. - Modha, Masry (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC