The Review of Cache Application Technology in CMP

Abstract:

The chip-multiprocessor (CMP) have been main stream of current processors, and it integrates the multi-core into the chip so that it can make full use of the growing transistor resources; in the meantime the further development and utilization make the thread level parallelism become possible. In CMP structure Cache plays a more and more important role. So we introduce some new cache technology in this paper.

• Periodical: Applied Mechanics and Materials (Volumes 291-294)
• Pages: 2802-2804
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.291-294.2802
• Online since: February 2013
• Authors: Shuo Li, Gao Chao Xu, Xiao Lin Qiao, Feng Wu
• Keywords: Cache Partitioning, Cache Replacement, CMP, Fairness

References

[1] Lin Deng, Yong Dou, Jing Zhang, Xin Li, Performance Characters of OLTP in CMP, JCIT: Journal of Convergence Information Technology, Vol. 6, No. 3, pp.1-9, (2011).

[2] H. S. Stone, J. Turek, and J. L. Wolf. Optimal partitioning of cache memory. IEEE Transactions on Computers, 41(9), (1992).

DOI: 10.1109/12.165388

[3] G. E. Suh , L. Rudolph and S. Devadas, Dynamic Cache Partitioning for CMP/SMT Systems[C].

[4] G. E. Suh et al. Dynamic partitioning of shared cache memory[J]. Journal of Supercomputing, 28(1), (2004).

[5] Qureshi M K, Patt Y N. Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches[C]. IEEE Computer Society, (2006).

DOI: 10.1109/micro.2006.49

[6] R. E. Matick, T. J. Heller A M I. Analytical analysis of finite cache penalty and cycles per instruction of a multiprocessor memory hierarchy using miss rates and queuing theory[J]. IBM Journal Of Research And Development. 2001, 45(6): 819-843.

DOI: 10.1147/rd.456.0819

[7] GuangS, Xun junY. A Weighted Dynamic Shared Cache Partitioning Mechanism forMulti-Threaded Multi-Programmed Workloads[J]. Chinese Journal OF Computers . 2008. 31(11): 1938-(1946).

DOI: 10.3724/sp.j.1016.2008.01938

[8] Seongbeom Kim, Dhruba Chandra and Yan Solihin. Fair Cache Sharing and Partitioning in a Chip Multiprocessor Architecture. [C]. International Conference on Parallel Architectures and Compilation Techniques. (2004).

DOI: 10.1109/pact.2004.1342546

[9] L. A. Belady. A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal, (1966).

[10] E. J. O'Neil, P. E. O'Neil, and G. Weikum. An Optimality Proof of the LRU-K Page Replacement Algorithm, Journal of the ACM, (1999).

[11] A. -C. Lai, C. Fide, and B. Falsafi. Dead-block prediction & dead-block correlating prefetchers. SIGARCH Comput. Archit. News, 29(2): 144–154, (2001).

DOI: 10.1145/384285.379259

[12] M. Kharbutli and Y. Solihin. Counter-based cache replacement and bypassing algorithms. IEEE Transactions on Computers, 57(4): 433–447, (2008).

DOI: 10.1109/tc.2007.70816