A case for MLP-aware cache replacement

Proceedings - International Symposium on Computer Architecture

Volumn 2006, Issue , 2006, Pages 167-177

  Qureshi, Moinuddin K ^a   Lynch, Daniel N ^a   Mutlu, Onur ^a   Patt, Yale N ^a  

^a The University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE REPLACEMENT; LONG LATENCY MEMORY ACCESSES; MEMORY LEVEL PARALLELISM (MLP); SAMPLING BASED ADAPTIVE REPLACEMENT (SBAR);

BENCHMARKING; COMPUTER HARDWARE; COST ACCOUNTING; SAMPLING;

BUFFER STORAGE;

EID: 33845874613     PISSN: 10636897     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCA.2006.5     Document Type: Conference Paper

References (25)

1. H. Akkary, R. Rajwar, and S. T. Srinivasan. Checkpoint processing and recovery: Towards scalable large instruction window processors. In Proceedings of the 36th Annual ACM/IEEE International Symposium on Microarchitecture, 2003.
2. L. A. Belady. A study of replacement algorithms for a virtual-storage computer. In IBM Systems Journal, pages 78-101, 1966.
3. Y. Chou, B. Fahs, and S. Abraham. Microarchitecture optimizations for exploiting memory-level parallelism. In Proceedings of the 31st Annual International Symposium on Computer Architecture., 2004.
4. A. Cristal et al. Kilo-instruction processors: Overcoming the memory wall. IEEE Micro, 25(3), May 2005.
5. J. Dundas and T. Mudge. Improving data cache performance by preexecuting instructions under a cache miss. In Proceedings of the 1997 International Conference on Supercomputing, 1997.
6. A. Glew. MLP yes! ILP no! In Wild and Crazy Ideas Session, 8th International Conference on Architectural Support for Programming Languages and Operating Systems, October 1998.
7. E. G. Hallnor and S. K. Reinhardt. A fully associative software-managed cache design. In Proceedings of the 27th Annual International Symposium on Computer Architecture, pages 107-116, 2000.
8. J. Jeong and M. Dubois. Optimal replacements in caches with two miss costs. In SPAA '99: Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures, 1999.
9. J. Jeong and M. Dubois. Cost-sensitive cache replacement algorithms. In Proceedings of the 9th International Symposium on High Performance Computer Architecture, 2003.
10. T. Karkhanis and J. E. Smith. A day in the life of a data cache miss. In Second Annual Workshop on Memory Performance Issues, 2002.
11. T. S. Karkhanis and J. E. Smith. A first-order superscalar processor model. In Proceedings of the 31st Annual International Symposium on Computer Architecture, 2004.
12. D. Kroft. Lockup-free instruction fetch/prefetch cache organization. In Proceedings of the 8th Annual International Symposium on Computer Architecture, 1981.
13. S. McFarling. Combining branch predictors. Technical Report TN-36, Digital Western Research Laboratory, June 1993.
14. N. Megiddo and D. Modha. ARC: A low overhead self tuning replacement cache. In USENIX File and Storage Technologies, 2003.
15. O. Mutlu, J. Stark, C. Wilkerson, and Y. N. Patt. Runahead execution: An alternative to very large instruction windows for out-of-order processors. In Proceedings of the 9th International Symposium on High Performance Computer Architecture, 2003.
16. N. Young. The K-server dual and loose competetiveness for paging. Agorithmica, 11(2):525-541, 1994.
17. V. S. Pai and S. Adve. Code transformations to improve memory parallelism. In Proceedings of the 32nd Annual ACM/IEEE International Symposium on Microarchitecture, 1999.
18. S. Palacharla and R. E. Kessler. Evaluating stream buffers as a secondary cache replacement. In Proceedings of the 21st Annual International Symposium on Computer Architecture, 1994.
19. E. Perelman et al. Using SimPoint for accurate and efficient simulation. ACM SIGMETRICS Performance Evaluation Review, 2003.
20. M. K. Qureshi, D. Thompson, and Y. N. Patt. The V-Way cache: Demand based associativity via global replacement. In Proceedings of the 32nd Annual International Symposium on Computer Architecture, 2005.
21. S. T. Srinivasan, R. D.-C. Ju, A. R. Lebeck, and C. Wilkerson. Locality vs. criticality. In Proceedings of the 28th Annual International Symposium on Computer Architecture, 2001.
22. S. T. Srinivasan and A. R. Lebeck. Load latency tolerance in dynamically scheduled processors. In Proceedings of the 31st Annual ACM/IEEE International Symposium on Microarchitecture, 1998.
23. M. V. Wilkes. The memory gap and the future of high performance memories.ACM Computer Architecture News, 29(1):2-7, Mar. 2001.
24. W. A. Wong and J.-L. Baer. Modified LRU policies for improving second-level cache behavior. In Proceedings of the 6th International Symposium on High Performance Computer Architecture, 2000.
25. H. Zhou. Dual-core execution: Building a highly scalable singlethread instruction window. In Proceedings of the 14th International Conference on Parallel Architectures and Compilation Techniques, 2005.