Yannis Smaragdakis College of Computing Georgia Institute of Technology...  Home/Search
Context
Related
| gatech.edu/~yannis/adaptive2.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: gatech.edu/~yannis/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We propose a general scheme for creating adaptive replacement policies with good performance and strong theoretical guarantees. Specifically, we show how to combine any two existing replacement policies so that the resulting policy provably can never perform worse than either of the original policies by more than a small factor. To show that our scheme performs very well with real application data, we derive a virtual memory replacement policy that adapts between LRU, loop detection, LFU, and... (Update)
Active bibliography (related documents): More All
3.3: General Adaptive Replacement Policies - Smaragdakis (2004) (Correct)
1.2: Compressed Caching and Modern Virtual Memory Simulation - Kaplan (1999) (Correct)
0.4: Trace Reduction for Virtual Memory Simulations - Scott Kaplan Yannis (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ college-general,
author = "Yannis Smaragdakis College",
title = "General Adaptive Replacement Policies",
url = "citeseer.ist.psu.edu/745999.html" }
Citations (may not include all citations):65 ciency of list update and paging rules (context) - Sleator, Tarjan - 1985
61 Execution characteristics of desktop applications on windows.. - Lee, Crowley et al. - 1998
49 Markov paging (context) - Karlin, Phillips et al. - 1992
40 Adaptive page replacement based on memory reference behavior - Glass, Cao - 1997
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
24 low overhead replacement cache (context) - Megiddo, Modha et al. - 2003
17 Distance string models for program behavior (context) - Spirn - 1976
9 Trace reduction for virtual memory simulations - Kaplan, Smaragdakis et al. - 1999
7 LRFU: A spectrum of policies that subsumes the least recentl.. - Lee, Choi et al. - 2001
5 The EELRU adaptive replacement algorithm (context) - Smaragdakis, Kaplan et al. - 2003
5 Computation of pf probabilities from program transition diag.. (context) - Franklin, Gupta - 1974
4 cient low inter-reference recency set replacement policy to .. (context) - Jiang, Zhang et al. - 2002
4 Data cache management using frequency-based replacement (context) - Robertson, Devarakonda - 1990
3 EELRU: Simple and e#cient adaptive page replacement (context) - Smaragdakis, Kaplan et al. - 1999
3 A decompsable model of program paging behavior (context) - Courtois, Vantilborgh - 1976
3 IFIP Congress Booklet D (context) - Baylis, Fletcher et al. - 1968
2 Page replacement algorithm for large-array manipulation (context) - Muramatsu, Negishi - 1980
2 and performance evaluation of a detection-based adaptive blo.. (context) - Choi, Noh et al. - 2002
Documents on the same site (http://www-static.cc.gatech.edu/~yannis/): More
Statically Safe Program Generation with SafeGen - Huang, Zook, Smaragdakis (Correct)
Binary Refactoring: Improving Code behind the Scenes - Tilevich, al. (2005) (Correct)
Automatic Partitioning: A Promising Approach to.. - Liogkas.. (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