Open Access
Subscription Access
Open Access
Subscription Access
Relative Performance of a Multi-level Cache with Last-level Cache Replacement: An Analytical Review
Subscribe/Renew Journal
Current day processors employ multi-level cache hierarchy with one or two levels of private caches and a shared last-level cache (LLC). Replacement policy at the Last Level Cache is vital due to reduction of off-chip memory latency as well as conflict for memory bandwidth. Cache replacement techniques for inclusive LLCs may not be efficient for multilevel cache as it can be shared by enormous applications with varying access behavior, running simultaneously. One application may dominate another by flooding of cache requests and evicting the useful data of the other application. This paper analyzes some of the existing replacement techniques on the LLC with their performance assessment.
Keywords
Cache Performance, Multi-level Cache, Last Level Cache (LLC)
Subscription
Login to verify subscription
User
Font Size
Information
- Warrier, T. S., Anupama, B. & Mutyam, M. (2013). An Application-Aware Cache Replacement Policy for Last-Level Caches. ARCS 2013, LNCS 7767, (pp. 207-219).
- Chaudhuri, M. & Subramoney, S. (2011). Bypass and Insertion Algorithms for Exclusive Last-Level Caches. Computer Architecture (ISCA), 38th Annual International Symposium, (pp. 81-92).
- Stackhouse, B. et al. (2009). A 65 nm 2-billion transistor quad-core Itanium processor. IEEE Journal of Solid-State Circuits, 44(1), 18-31.
- Kalla, R. et al. (2007). Power7: IBM's next-generation server processor. IEEE Micro, 30, 7-15.
- Tyson, G. et al. (1995). A Modified Approach to Data Cache Management. In Proceedings of the 28th Annual International Symposium on Micro architecture, (pp. 93-103).
- Johnson, T. L. et al. (1999). Run-time cache bypassing. IEEE Transactions on Computers, December, (48, 1338-1354).
- Rivers, J. A. et al. (1998). Utilizing Reuse Information in Data Cache Management. In Proceedings of the 12th International Conference on Supercomputing, (pp. 449-456).
- Lin, W. F. & Reinhardt, S. (2002). Predicting Last-Touch References under Optimal Replacement. Technical Report CSETR- 447-02. United States: University of Michigan.
- Kharbutli, M. & Solihin, Y. (2008). Counter-based cache replacement and bypassing algorithms. IEEE Transactions on Computers, 57, 433-447.
- Valero, A., Sahuquillo, J., Petit, S., Lopez, P. & Duato, J. (2011). MRU-Tour-based Replacement Algorithms for Last-Level Caches. 23rd International Symposium on Computer Architecture and High Performance Computing.
- Keramidas, G., Petoumenos, P. & Kaxiras, S.(2007). Cache Replacement Based on Reuse Distance Prediction. International Conference on Computer Design.
- Paikaray, R. B. & Swain, D. (2011). AWRP:Adaptive Weight Ranking Policy for Improving Cache Performance. Journal of Computing, February, 3(2), 209-214.
- Wood, D., Hill, M. D. & Kessler, R. E. (1991). A Model for Estimating Trace-Sample Miss Ratios. In Proceedings of the 1991 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, (pp. 79-89).
- Standard Performance Evaluation Corporation. (2013). Retrieved from http://www.spec.org/cpu2000.
Abstract Views: 368
PDF Views: 8