Cache replacement based on reuse-distance prediction

2007 IEEE International Conference on Computer Design, ICCD 2007

Volumn , Issue , 2007, Pages 245-250

  Keramidas, Georgios ^a   Petoumenos, Pavlos ^a   Kaxiras, Stefanos ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE DECAY; CACHE MANAGEMENT TECHNIQUES; CACHE-REPLACEMENT; COMPUTER DESIGNS; INTERNATIONAL CONFERENCES; L2 CACHE; REPLACEMENT ALGORITHMS; REPLACEMENT POLICY;

CACHE MEMORY; FORECASTING; INDUSTRIAL MANAGEMENT;

OPTIMIZATION;

EID: 52949085794     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCD.2007.4601909     Document Type: Conference Paper

References (15)

1. L. A. Belady. A study of replacement algorithms for a virtual-storage computer. IBM. Systems Journal, 1966.
2. E. J. O'Neil, P. E. O'Neil, and G. Weikum. An Optimally Proof of die LRU-K Page Replacement Algorithm, Journal of the ACM, 1999.
3. M. Karlsson and E. Hagersten. Timestamp-Based Selective Cache Allocation. In the Workshop on Memory Performance Issues, 2001.
4. P. Petoumenos, G. Keramidas, H. Zeffer, S. Kaxiras, and E. Hagersten. Modeling Cache Sharing on Chip Multiprocessor Architectures. Proc. of the International Symposium on Workload Characterization, 2006.
5. J. Jeong and M. Dubois. Cost-sensitive cache replacement algorithms. Proc. of the International Symposium on High Performance Computer Architecture, 2003.
6. W. A. Wong and J. L. Baer. Modified LRU policies for improving second-level cache behavior. Int. Symposium on High-Performance Computer Architecture, 2000.
7. Z. Hu, S. Kaxiras, and M. Martonosi. Timekeeping in the memory system: predicting and optimizing memory behavior. Proc. of the 29th International Symposium on Computer Architecture, 2002.
8. J. Abella, A. Gonzalez, X. Vera, and M. O'Boyle. IATAC: a Smart Predictor to Turn-Off L2 Cache Lines. ACM Transactions on Architecture and Code Optimization, 2005.
9. W. F. Lin and S. K. Reinhardt. Predicting last-touch references under optimal replacement. University of Michigan Technical Report (CSE-TR-447-02), 2002.
10. M. Takagi and K. Hiraki. Inter-Reference Gap Distribution Replacement: an Improved Replacement Algorithm for Set-Associative Caches. Proc. of the International Conference on Supercomputing, 2004.
11. A. C. Lai and B. Falsafi. Selective, accurate, and timely self-invalidation using last-touch prediction. Proc. of the International Symposium on Computer Architecture, 2000.
12. T. Johnson, D. Connors, M. Merten, and W. Hwu. Run-Time Cache Bypassing. IEEE Trans. on Computers, 1999.
13. E. Berg and E. Hagersten. Fast Data-Locality Profiling of Native Execution. Proc. of the ACM SIGMETRICS, 2005.
14. Y. Zhong, S. Dropsho, and C. Ding. Miss rate prediction across all program inputs. Proc. of the Conference on Parallel Architectures and Compilation Techniques, 2003.
15. C. Fang, S. Carr, S. Onder, and Z. Wang. Instruction Based Memory Distance Analysis and its Application to Optimization. Proc. of the International Conference on Supercomputing, 2006.