Abstract
To improve performance and fairness of the LLC shared among the multiple cores, the recent Promotion/Insertion Pseudo-Partitioning (PIPP) that combines dynamic insertion and promotion into the cache management policy. Compared with PPIP, in this work we propose a new Homologous Promotion Insertion Policy (HPIP) which can determine the insertion position when a new core situation occurs and balance the cache resource allocation simultaneously. HPIP depends on the existing cache structure and require negligible change overhead. In addition, we analyze Dynamic Insertion Policy (DIP) and maintain that the sampling sets selection for Set Dueling Monitors (SDM) should be according to a processor’s cores number rather than the running applications. Finally, our experiments with multi-programmed workloads for 2-core, 4-core CMPs based on M5 simulator show that the performance of HPIP approximate to PPIP and its adaptive capability is enhanced.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Qureshi, M.K., Patt, Y.N.: Utility-Based Cache Partitioning: A Low Overhead High-Performance Runtime Mechanism to Partition Shared Caches. In: IEEE 39th International Symposium on Microarchitecture, pp. 423–432. IEEE Press, Orlando (2006)
Suh, G.E., Rudolph, L., Devadas, S.: Dynamic Partitioning of Shared Cache Memory. Journal of Supercomputing 28(1), 7–26 (2004)
Haiming, L., Michael, F., Jaehyuk, H., Doug, B.: Cache Bursts: A New Approach for Eliminating Dead Blocks and Increasing Cache Efficiency. In: IEEE 41th International Symposium on Microarchitecture, pp. 222–233. IEEE Press, Washington (2008)
Qureshi, M.K., Jaleel, A., Patt, Y.N., Steely, J., Emer, J.: Adaptive Insertion Policies for High-Performance Caching. In: 34th IEEE/ACM International Symposium on Computer Architecture, pp. 381–391. ACM, San Diego (2007)
Yuejian, X., Gabriel, H.L.: PIPP: Promotion/Insertion Pseudo-Partitioning of Multi-Core Shared Caches. In: 36th IEEE/ACM International Symposium on Computer Architecture, pp. 174–183. ACM, Austin (2009)
Qureshi, M.K., Lynch, D.N., Mutlu, O., Patt, Y.N.: A Case for MLP-Aware Cache Replacement. In: 33th IEEE/ACM International Symposium on Computer Architecture, pp. 167–178. ACM, New York (2006)
Aamer, J., William, H., Qureshi, M.K., Sebot, J., Simon, S.J., Emer, J.: Adaptive Insertion Policies for Managing Shared Caches. In: 7th International Conference on Parallel Architecture and Compilation Techniques, Toronto, pp. 208–219 (2008)
The M5 Simulator System Information, http://www.m5sim.org/wiki/index.php/Main_Page
Qureshi, M.K.: Adaptive Spill-Receive for Robust High-Performance Caching in CMPs. In: 15th International Symposium on High-Performance Computer Architecture, pp. 45–54 (2009)
Dongyuan, Z., Hong, J., Seth, S.C.: Exploiting Set-Level Non-Uniformity of Capacity Demand to Enhance CMP Cooperative Caching. In: IEEE International Parallel & Distributed Processing, pp. 1–10 (2010)
Jichuan, C., Gurindar, S.S.: Cooperative Cache Partitioning for Chip Multiprocessors. In: 21th Annual International Conference on Supercomputing, pp. 242–252 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Du, J., Zhang, Y., Wu, Z., Wang, X. (2010). Management Policies Analysis for Multi-core Shared Caches. In: Cao, L., Zhong, J., Feng, Y. (eds) Advanced Data Mining and Applications. ADMA 2010. Lecture Notes in Computer Science(), vol 6441. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17313-4_52
Download citation
DOI: https://doi.org/10.1007/978-3-642-17313-4_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17312-7
Online ISBN: 978-3-642-17313-4
eBook Packages: Computer ScienceComputer Science (R0)