A comparative analysis of performance improvement schemes for cache memories

Computers and Electrical Engineering

Volumn 38, Issue 2, 2012, Pages 243-257

  Kavi, Krishna ^a   Nwachukwu, Izuchukwu ^a   Fawibe, Ademola ^a  

^a UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADDRESSING SCHEME; ASSOCIATIVITY; CACHE ACCESS; CACHE MISS; COMPARATIVE ANALYSIS; CONFLICT MISS; EXPERIMENTAL SETUP; INDEXING SCHEME; MEMORY ACCESS; NONUNIFORMITY; PERFORMANCE IMPROVEMENTS; PRELIMINARY DATA;

COMPUTER SCIENCE; ELECTRICAL ENGINEERING;

CACHE MEMORY;

EID: 84858073551     PISSN: 00457906     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compeleceng.2011.12.008     Document Type: Article

References (22)

1. Givargis T. Improved indexing for cache miss reduction in embedded systems. In: IEEE/ACM design automation conference (DAC). Anaheim; 2003. p. 872-80.
2. Naz A, Adamo O, Kavi K, Janjusic T. Improving uniformity of cache access patterns using split data caches. In: Proceedings of ISCA conference on parallel and distributed computer systems (PDCS-2009). KY: Louisville; 2009.
3. Peir J, Lee Y, Hsu W. Capturing dynamic memory reference behavior with adaptive cache topology. In: Proceedings of the 8th international conference on architectural support for programming language and operating systems (TOPLAS); 1998. p. 240-50.
4. Zhang C. Balanced cache: reducing conflict misses of direct-mapped caches. In: ACM international symposium on computer architecture (ISCA-06); 2006. p. 155-66. (Pubitemid 46016612)
5. Adamo O, Naz A, Kavi K, Janjusic T, Chung CP. Smaller split L-1 data caches for multi-core processing systems. Proceedings of IEEE 10th international symposium on pervasive systems, algorithms and networks (I-SPAN 2009). Taiwan: Kao-Hsiung; 2009. p. 14-6.
6. Agarwal A, Pudar SD. Column-associative caches: a technique for reducing the miss rate of direct-mapped caches. In: Proceedings of the international symposium on computer architecture (ISCA-93); 1993. p. 179-80.
7. Berger E, Zorn B, McKinley K. Reconsidering custom memory allocation. Proceedings of the 17th ACM conference on object-oriented programming systems, languages and applications (OOPSLA '02); 2002. p. 1-12.
8. Calder B, Krintz C, John S, Austin T. Cache-conscious data placement. In: Proceedings of 8thACM international conference on architectural support for programming language and operating systems (ASPLOS); 1998.
9. Carr S, McKinley KS, Tseng C-W. Compiler optimizations for improving data locality. In: Proceedings of ACM international conference on architectural support for programming language and operating systems (ASPLOS); 1994. p. 252-62.
10. Chilimbi TM, Larus JR, Hill MD. Tools for cache conscious data structures. In: Proceedings of ACM conference on programming languages, design and implementation (PLDI); 1999.
11. Jula A, Rauchwerger L. How to focus on memory allocation strategies. Tech Rept TR 07-003, Department of Computer Science, Texas A&M University.
12. Jula A, Rauchwerger L. Custom memory allocation for free. In: Proceedings of the 19th international conference on Languages and compilers for parallel computing (LCPC '06). New Orleans: Springer-Verlag; 2007. p. 299-313.
13. Kulkarni C, Ghez C, Miranda M, Catthoor F, Man HD. Cache conscious data layout organization for conflict miss reduction in embedded multimedia applications. In: IEEE transactions on computers, vol. 54(1); 2005.
14. Lattner C, Adve V. Automatic pool allocation: improving performance by controlling data structure layout in the heap. Proceedings of ACM conference on programming languages design and implementation (PLDI); 2005. p. 129-42.
15. Luk CK, Mowry T. Compiler based prefetching for recursive data structures. In: Proceedings of the 7th international conference on architectural support for programming languages and operating systems (ASPLOS VII); 1996. p. 222-33.
16. Seidl ML, Zorn BG. Segregating heap objects by reference behavior and lifetime. Proceedings of the eight international conference on architectural support for programming languages and operating systems (ASPLOS VIII); 1998. p. 12-23.
17. Wolf, ME, Lam MS. A data locality-optimizing algorithm. In: Proceedings of ACM programming language, design and implementation (PLDI'91); 1991. p. 30-44.
18. Patel K, Macii E, Benini L, Poncino M. Reducing cache misses by application-specific re-configurable indexing. In: Proceedings of the 2004 IEEE/ACM international conference on computer-aided design (ICCAD '04); 2004. p. 125-30. (Pubitemid 40449224)
19. Kharbutli M, Irwin K, Solihin Y, Lee J. Using prime numbers for cache indexing to eliminate conflict misses. Proceedings of the international symposium on high performance computer architecture (HPCA); 2004.
20. Aho AV, Ullman JD. Principles of compiler design. Addison-Wesley; 1997.
21. Raghavan R, Hayes J. On randomly interleaved memories. In: Proceedings of the international conference on Supercomputing; 1990.
22. Burger D, Austin TM. The SimpleScalar Tool Set, Version 2.0. University of Wisconsin-Madison Computer Sciences Department of Technical Report #1342; 1997.