Abstract:
LRU is a well-known buffer management policy under which an element buffer of size k always stores the k most recently used elements. Many variants of the policy are widely used in memory systems (e.g., virtual memory subsystems). We study a simple-to-state algorithmic problem called the LRU trace reduction problem: for a sequence of references to elements (a reference trace), compute the shortest sequence with identical LRU behavior for buffers of at least a given size. Despite the straightforward statement of the problem, its solution is non-trivial. We offer an efficient algorithm with important practical applications in performance analysis.
Citations
|
6058
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 2001
|
|
651
|
Tarjan. Amortized Efficiency of List Update and Paging Rules
– Sleator, E
|
|
205
|
Evaluation techniques for storage hierarchies
– Mattson, Gecsei, et al.
- 1970
|
|
126
|
T.N.: Trace-driven memory simulation: A survey
– Uhlig, Mudge
- 1997
|
|
116
|
Competitive paging with locality of reference
– Borodin, Irani, et al.
- 1995
|
|
113
|
Data Cache Management Using Frequency-Based Replacement
– Robinson, Devarakonda
- 1990
|
|
61
|
Adaptive Page Replacement Based on Memory Reference
– Glass, Cao
- 1997
|
|
47
|
Mache: No-loss trace compaction
– Samples
- 1988
|
|
32
|
Two Methods for the Efficient Analysis of Memory Address Trace Data
– Smith
- 1977
|
|
32
|
Blocking: Exploiting Spatial Locality for Trace Compaction
– Agarwal, Huffman
- 1990
|
|
31
|
PDATS: Lossless Address Trace Compression for Reducing File Size and Access Time
– Johnson, Ha
- 1994
|
|
17
|
Two-Level Replacement Decisions in Paging Stores
– Babaoglu, Ferrari
- 1983
|
|
17
|
Segmented FIFO Page Replacement
– Turner, Levy
- 1981
|
|
16
|
LRU is better than FIFO
– Chrobak, Noga
- 1998
|
|
9
|
Effect of Replacement Algorithms on a Paged Buffer Database System
– Fernandez, Lang, et al.
- 1978
|
|
6
|
Performance predictions for extended paged memories
– Coffman, Randell
- 1970
|
|
6
|
EELRU: Simple and efficient adaptive page replacement
– Smaragdakis, Kaplan, et al.
- 1999
|
|
4
|
Virtual memory reference tracing using user-level access protections
– Wilson, Kaplan, et al.
- 1997
|
|
3
|
Efficient Generation of Memory Reference
– Babaoglu
- 1990
|
|
2
|
Trace Reduction for Virtual Memory Simulations", UTexas CS
– Kaplan, Smaragdakis, et al.
|
|
