Using dead blocks as a virtual victim cache

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

Volumn , Issue , 2010, Pages 489-500

  Khan, Samira M ^a   Jiménez, Daniel A ^a   Burger, Doug ^b   Falsafi, Babak ^c  

^a UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

^b MICROSOFT RESEARCH   (United States)

^c EPFL   (Switzerland)

Author keywords

cache management; microarchitecture; prediction

Indexed keywords

FORECASTING; PARALLEL ARCHITECTURES; STATIC RANDOM ACCESS STORAGE;

CACHE EFFICIENCY; CACHE MANAGEMENT; IMPROVE PERFORMANCE; MICRO ARCHITECTURES; MODERN PROCESSORS; SET-ASSOCIATIVE; SINGLE-THREADED; THROUGHPUT PERFORMANCE;

CACHE MEMORY;

EID: 78149268048     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1854273.1854333     Document Type: Conference Paper

References (26)

1. J. Abella, A. González, X. Vera, and M. F. P. O'Boyle. Iatac: a smart predictor to turn-off l2 cache lines. ACM Trans. Archit. Code Optim., 2(1):55-77, 2005.
2. L. A. Belady. A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal, 5(2):78-101, 1966.
3. D. Burger and T. M. Austin. The SimpleScalar tool set version 2.0. Technical Report 1342, Computer Sciences Department, University of Wisconsin, June 1997.
4. D. Burger, J. R. Goodman, and A. Kagi. The declining effectiveness of dynamic caching for general-purpose microprocessors. Technical Report 1261, 1995.
5. Z. Hu, S. Kaxiras, and M. Martonosi. Timekeeping in the memory system: predicting and optimizing memory behavior. SIGARCH Comput. Archit. News, 30(2):209-220, 2002.
6. N. P. Jouppi. Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers. SIGARCH Comput. Archit. News, 18(3a), 1990.
7. G. Keramidas, P. Petoumenos, and S. Kaxiras. Cache replacement based on reuse-distance prediction. In ICCD, pages 245-250, 2007.
8. M. Kharbutli and Y. Solihin. Counter-based cache replacement and bypassing algorithms. IEEE Transactions on Computers, 57(4):433-447, 2008.
9. A.-C. Lai and B. Falsafi. Selective, accurate, and timely self-invalidation using last-touch prediction. In International Symposium on Computer Architecture, pages 139-148, 2000.
10. A.-C. Lai, C. Fide, and B. Falsafi. Dead-block prediction & dead-block correlating prefetchers. SIGARCH Comput. Archit. News, 29(2):144-154, 2001.
11. A. R. Lebeck and D. A. Wood. Dynamic self-invalidation: reducing coherence overhead in shared-memory multiprocessors. SIGARCH Comput. Archit. News, 23(2):48-59, 1995.
12. H. Liu, M. Ferdman, J. Huh, and D. Burger. Cache bursts: A new approach for eliminating dead blocks and increasing cache efficiency. In Proceedings of the IEEE/ACM International Symposium on Microarchitecture, pages 222-233, Los Alamitos, CA, USA, 2008. IEEE Computer Society.
13. G. H. Loh. Extending the effectiveness of 3d-stacked dram caches with an adaptive multi-queue policy. In MICRO 42: Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture, pages 201-212, New York, NY, USA, 2009. ACM.
14. P. Michaud, A. Seznec, and R. Uhlig. Trading conflict and capacity aliasing in conditional branch predictors. In Proceedings of the 24th International Symposium on Computer Architecture, pages 292-303, June 1997.
15. E. Perelman, G. Hamerly, M. Van Biesbrouck, T. Sherwood, and B. Calder. Using simpoint for accurate and efficient simulation. SIGMETRICS Perform. Eval. Rev., 31(1):318-319, 2003.
16. M. K. Qureshi, A. Jaleel, Y. N. Patt, S. C. S. Jr., and J. S. Emer. Adaptive insertion policies for high performance caching. In 34th International Symposium on Computer Architecture (ISCA 2007), June 9-13, 2007, San Diego, California, USA. ACM, 2007.
17. M. K. Qureshi, D. N. Lynch, O. Mutlu, and Y. N. Patt. A case for mlp-aware cache replacement. In ISCA '06: Proceedings of the 33rd annual international symposium on Computer Architecture, pages 167-178, Washington, DC, USA, 2006. IEEE Computer Society.
18. M. K. Qureshi, D. N. Lynch, O. Mutlu, and Y. N. Patt. A case for mlp-aware cache replacement. In ISCA '06: Proceedings of the 33rd annual international symposium on Computer Architecture, pages 167-178, Washington, DC, USA, 2006. IEEE Computer Society.
19. M. K. Qureshi and Y. N. Patt. Utility-based cache partitioning: A low-overhead, high-performance, runtime mechanism to partition shared caches. In MICRO 39: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture, pages 423-432, Washington, DC, USA, 2006. IEEE Computer Society.
20. M. K. Qureshi, D. Thompson, and Y. N. Patt. The v-way cache: Demand based associativity via global replacement. SIGARCH Comput. Archit. News, 33(2):544-555, 2005.
21. D. Rolán, B. B. Fraguela, and R. Doallo. Adaptive line placement with the set balancing cache. In MICRO 42: Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture, pages 529-540, New York, NY, USA, 2009. ACM.
22. J. B. Sartor, S. Venkiteswaran, K. S. McKinley, and Z. Wang. Cooperative caching with keep-me and evict-me. Annual Workshop on Interaction between Compilers and Computer Architecture, 0:46-57, 2005.
23. A. Seznec. A case for two-way skewed-associative caches. In ISCA '93: Proceedings of the 20th annual international symposium on Computer architecture, pages 169-178, New York, NY, USA, 1993.
24. S. Somogyi, T. F. Wenisch, N. Hardavellas, J. Kim, A. Ailamaki, and B. Falsafi. Memory coherence activity prediction in commercial workloads. In WMPI '04: Proceedings of the 3rd workshop on Memory performance issues, pages 37-45, New York, NY, USA, 2004. ACM.
25. S. Thoziyoor, N. Muralimanohar, J. H. Ahn, and N. P. Jouppi. Cacti 5.1. Technical report HPL-2008-20, 2008.
26. Z. Wang, K. S. McKinley, A. L. Rosenberg, and C. C. Weems. Using the compiler to improve cache replacement decisions. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, page 199, Los Alamitos, CA, USA, 2002. IEEE Computer Society.