Abstract:
LRU buffer management is a 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 algorithmic problem (called the trace reduction problem): given a sequence of references to elements (a reference trace), compute the shortest sequence with identical LRU behavior for buffers of at least a certain size. Despite the straightforward statement of the problem, its solution is non-trivial. We offer an algorithm and discuss its practical applications. These are mostly in the area of trace-driven program simulation: for quite realistic buffer sizes, reference traces from real programs can be reduced by a factor of up to several orders of magnitude. This compares favorably with all previous trace reduction techniques in the literature.
Citations
|
5825
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 1992
|
|
634
|
Amortized efficiency of list update and paging rules
– Sleator, Tarjan
- 1985
|
|
194
|
Evaluation techniques for storage hierarchies
– Mattson, Gecsei, et al.
|
|
121
|
Trace-driven memory simulation: a survey
– Uhlig, Mudge
- 1997
|
|
114
|
Competitive paging with locality of reference
– Borodin, Irani, et al.
- 1995
|
|
110
|
Data cache management using frequency-based replacement
– Robinson, Devarakonda
- 1990
|
|
59
|
Adaptive Page Replacement Based on Memory Reference
– Glass, Cao
- 1997
|
|
45
|
MACHE: no-loss trace compaction
– Samples
- 1989
|
|
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
|
|
30
|
PDATS: Lossless address trace compression for reducing file size and access time
– Johnson, Ha
- 1994
|
|
16
|
Two-level replacement decisions in paging stores
– Babaoglu, Ferrari
- 1983
|
|
16
|
LRU is better than FIFO
– Chrobak, Noga
- 1998
|
|
16
|
Segmented fifo page replacement
– Turner, Levy
- 1981
|
|
7
|
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.
|
