Less reused filter: Improving L2 cache performance via filtering less reused lines

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2009, Pages 68-79

  Lingxiang, Xiang ^a   Tianzhou, Chen ^a   Qingsong, Shi ^a   Wei, Hu ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Cache filtering; Less reused line

Indexed keywords

CACHE FILTERING; CACHE PERFORMANCE; FILTERING MECHANISM; L2 CACHE; LIFE SPAN; WORKING SET;

INTELLIGENT CONTROL;

CACHE MEMORY;

EID: 70449729946     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542275.1542290     Document Type: Conference Paper

References (36)

1. A. Basu, N. Kirman, M. Kirman, M. Chaudhuri, and J. Martinez. Scavenger: A new last level cache architecture with global block priority. In MICRO-40, 2007.
2. L. A. Belady. A study of replacement algorithms for a virtual-storage computer. IBM Systems journal, pages 78-101, 1966.
3. H. Dybdahl, P. Stenström, and L. Natvig. An lru-based replacement algorithm augmented with frequency of access in shared chip-multiprocessor caches. In MEDEA '06: Proceedings of the 2006 workshop on MEmory performance, 2006.
4. M. Takagi and K. Hiraki. Inter-reference gap distribution replacement: an improved replacement algorithm for set-associative caches. In ICS-18, 2004.
5. R. Subramanian, Y. Smaragdakis, and G. H. Loh. Adaptive caches: Effective shaping of cache behavior to workloads. In MICRO-39, 2006.
6. W. A. Wong and J.-L. Baer. Modified lru policies for improving second-level cache behavior. In HPCA-6, 2000.
7. K. Rajan and G. Ramaswamy. Emulating optimal replacement with a shepherd cache. In MICRO-40, 2007.
8. M. K. Qureshi, A. Jaleel, Y. N. Patt, S. C. Steely, and J. Emer. Adaptive insertion policies for high performance caching. In ISCA-34, 2007.
9. A. González, C. Aliagas, and M. Valero. A data cache with multiple caching strategies tuned to different types of locality. In ICS-9, 1995.
10. M. K. Qureshi, D. Thompson, and Y. N. Patt. The v-way cache: Demand based associativity via global replacement. In ISCA-32, 2005.
11. Y. Smaragdakis, S. Kaplan, and P. Wilson. The eelru adaptive replacement algorithm. Perform. Eval., 53(2):93-123, 2003.
12. K. Inoue, T. Ishihara, and K. Murakami. Way-predicting set-associative cache for high performance and low energy consumption. In ISLPED '99: Proceedings of the 1999 international symposium on Low power electronics and design, 1999.
13. B. Calder and D. Grunwald. Next cache line and set prediction. In ISCA-22, 1995.
14. Z. Hu, S. Kaxiras, and M. Martonosi. Timekeeping in the memory system: predicting and optimizing memory behavior. In ISCA-02, 2002.
15. A.-C. Lai, C. Fide, and B. Falsafi. Dead-block prediction & dead-block correlating prefetchers. In ISCA-28, 2001.
16. P. Pujara and A. Aggarwal. Increasing the cache efficiency by eliminating noise. In HPCA-12, 2006.
17. W. Lin and S. Reinhardt. Predicting last-touch references under optimal replacement. Technical Report CSE-TR-447-02, University of Michigan, 2002.
18. E. J. O'Neil, P. E. O'Neil, and G. Weikum. The lru-k page replacement algorithm for database disk buffering. In SIGMOD '93, 1993.
19. T. R. Puzak. Analysis of cache replacement-algorithms. Ph.D. thesis, 1985.
20. N. P. Jouppi. Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers. In ISCA-17, 1990.
21. D. Lee, J. Choi, J. H. Kim, S. H. Noh, S. L. Min, Y. Cho, and C. S. Kim. Lrfu: A spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE Trans. Comput., 50(12):1352-1361, 2001.
22. H. Liu, M. Ferdman, J. Huh, and D. Burger. Cache bursts: A new approach for eliminating dead blocks and increasing cache efficiency. In MICRO '08: Proceedings of the 2008 41st IEEE/ACM International Symposium on Microarchitecture, 2008.
23. N. Megiddo and D. S. Modha. Arc: A self-tuning, low overhead replacement cache. In Proceedings of the 2nd USENIX Conference on File and Storage Technologies, 2003.
24. 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.
25. M. Kharbutli and Y. Solihin. Counter-based cache replacement algorithms. In Proceedings of the 2005 international Conference on Computer Design, 2005.
26. M. K. Qureshi, D. N. Lynch, O. Mutlu, and Y. N. Patt. A case for mlp-aware cache replacement. In ISCA-33, 2006.
27. C.-H. Chi and H. Dietz. Improving cache performance by selective cache bypass. System Sciences, 1989. Vol.I: Architecture Track, Proceedings of the Twenty-Second Annual Hawaii International Conference on, 1:277-285 vol.1, 1989.
28. Y. Wu, R. Rakvic, L.-L. Chen, C.-C. Miao, G. Chrysos, and J. Fang. Compiler managed micro-cache bypassing for high performance epic processors. In MICRO 35: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture, 2002.
29. J. Rivers and E. Davidson. Reducing conflicts in direct-mapped caches with a temporality-based design. In ICPP '96, 1996.
30. T. L. Johnson and W. mei W. Hwu. Run-time adaptive cache hierarchy management via reference analysis. In ISCA-24, 1997.
31. T. L. Johnson, D. A. Connors, M. C. Merten, and W. mei W. Hwu. Run-time cache bypassing. IEEE Trans. Comput., 48(12):1338-1354, 1999.
32. Y. Etsion and D. G. Feitelson. L1 cache filtering through random selection of memory references. In PACT-16, 2007.
33. E. S. Tam, J. A. Rivers, V. Srinivasan, G. S. Tyson, and E. S. Davidson. Active management of data caches by exploiting reuse information. IEEE Trans. Comput., 48(11):1244-1259, 1999.
34. J. Jalminger and P. Stenstrom. A novel approach to cache block reuse predictions. In ICPP '03, 2003.
35. S. Kumar and C. Wilkerson. Exploiting spatial locality in data caches using spatial footprints. In ISCA-25, 1998.
36. 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, 2000.