Scott F. Kaplan, Yannis Smaragdakis, and Paul R. Wilson Dept. of Computer...  Home/Search
Context Related
| amherst.edu/~sfkaplan/c...KSW:TRVMS.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: amherst.edu/~sfkaplan/courses/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The unmanageably large size of reference traces has spurred the development of sophisticated trace reduction techniques. In this paper we present two new algorithms for trace reduction --- Safely Allowed Drop (SAD) and Optimal LRU Reduction (OLR). Both achieve high reduction factors and guarantee exact simulations for common replacement policies and for memories larger than a user-defined threshold. In particular, simulation on OLR-reduced traces is accurate for the LRU replacement algorithm,... (Update)
Similar documents based on text: More All
0.8: Trace Reduction for Virtual Memory Simulations - Kaplan, Smaragdakis, Wilson (Correct)
0.3: Flexible Reference Trace Reduction for VM Simulations - Scott Kaplan Amherst (2003) (Correct)
0.3: The Case for Compressed Caching in Virtual Memory Systems - Wilson, Kaplan, Smaragdakis (1999) (Correct)
BibTeX entry: (Update)
S.F. Kaplan, Y. Smaragdakis, and P. Wilson "Trace Reduction for Virtual Memory Simulations ", UTexas CS Tech. Report 98-24. http://citeseer.ist.psu.edu/kaplan04trace.html More
@inproceedings{ kaplan99trace,
author = "Scott F. Kaplan and Yannis Smaragdakis and Paul R. Wilson",
title = "Trace Reduction for Virtual Memory Simulations",
booktitle = "Measurement and Modeling of Computer Systems",
pages = "47-58",
year = "1999",
url = "citeseer.ist.psu.edu/kaplan04trace.html" }
Citations (may not include all citations):103 Evaluation Techniques for Storage Hierarchies (context) - Mattson, Gecsei et al. - 1970
88 Data Cache Management Using Frequency-Based Replacement (context) - Robinson, Devarakonda - 1990
88 The Working Set Model for Program Behavior (context) - Denning - 1976
64 Trace-Driven Memory Simulation: A Survey - Uhlig, Mudge
61 Execution Characteristics of Desktop Applications on Windows.. - Lee, Crowley et al.
40 Adaptive Page Replacement Based on Memory Reference Behavior - Glass, Cao
33 Mache: No-Loss Trace Compaction (context) - Samples
29 Analysis of Cache Replacement Algorithms (context) - Puzak - 1985
26 Blocking: Exploiting spatial locality for trace compaction (context) - Agarwal, Hu
23 PDATS: Lossless Address Trace Compression for Reducing File .. - Johnson, Ha - 1994
16 Two-Level Replacement Decisions in Paging Stores (context) - Babaoglu, Ferrari - 1983
11 Segmented FIFO Page Replacement (context) - Turner, Levy - 1981
9 Trace Reduction for Virtual Memory Simulations - Kaplan, Smaragdakis et al.
7 Performance Predictions for Extended Paged Memories (context) - Co, Randell - 1970
3 EELRU: Simple and E#cient Adaptive Page Replacement (context) - Smaragdakis, Kaplan et al.
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.amherst.edu/~sfkaplan/courses/spring-2004/cs40/papers/): More
Hoard: A Scalable Memory Allocator for Multithreaded.. - Berger, McKinley.. (2000) (Correct)
LIRS: An Efficient Low Inter-reference Recency Set Replacement .. - Jiang, Zhang (2002) (Correct)
USENIX Association - Fast Nd Usenix (2004) (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