Subscribe
Issue No.08 - Aug. (2013 vol.24)
pp: 1622-1632
Huang ZhiBin , Beihang University, Beijing
Zhu Mingfa , Beihang University, Beijing
Xiao Limin , Beihang University, Beijing
ABSTRACT
Partition enforcement policy is essential in the cache partition, and its main function is to protect the lines and retain the cache quota of each core. This paper focuses online protection based on its generation time rather than the CPU core ID that it belongs to or the position of the replacement stack, where it is located. The basic idea is that when a line is live, it must be protected and retained in the cache; when the line is &#x0022;dead,&#x0022; it needs to be evicted as early as possible. Therefore, the live-time protected counter (LvtP, four bits) is augmented to trace the lines' live time. Moreover, dead blocks are predicted according to the access event sequence. This paper presents a pseudopartition approach--LvtPPP and proposes a two-cascade victim selection mechanism to alleviate dead blocks based on the LRU replacement policy and the LvtP counter. LvtPPP also supports flexible handling of allocation deviation by introducing a parameter $(\lambda)$ to adjust the generation time of the line. There is significant improvement of the performance and fairness in LvtPPP over PIPP and UCP according to the evaluation results based on Simics.
INDEX TERMS
Radiation detectors, Resource management, Multicore processing, Partitioning algorithms, History, Pollution, Monitoring, dead block, Radiation detectors, Resource management, Multicore processing, Partitioning algorithms, History, Pollution, Monitoring, shared last-level-cache (LLC), Cache memories, cache partition
CITATION
Huang ZhiBin, Zhu Mingfa, Xiao Limin, "LvtPPP: Live-Time Protected Pseudopartitioning of Multicore Shared Caches", IEEE Transactions on Parallel & Distributed Systems, vol.24, no. 8, pp. 1622-1632, Aug. 2013, doi:10.1109/TPDS.2012.230
REFERENCES