Compressed Sharer Tracking and Relinquishment Coherence for Superior Directory Efficiency of Chip Multiprocessors
Issue No. 11 - Nov. (2017 vol. 66)
Wei Shu , Center for Advanced Computer Studies, University of Louisiana, Lafayette, LA
Nian-Feng Tzeng , Center for Advanced Computer Studies, University of Louisiana, Lafayette, LA
To lower on-chip SRAM area overhead for chip multiprocessors (CMPs), this work treats a novel directory design which compresses
present-bit vectors (PVs) by dropping “runs of zeros” commonly existing and lets PVs be transformed to their variations after sharer relinquishment for hashing alternative table sets to lift table utilization. Featured with relinquishment c oherence and compressed sharer t racking (ReCoST), the proposed design attains superior directory efficiency and maintains “exact” directory representations, as a result of dropping abound long runs of zeros present in PVs. According to full-system simulation using gem5 for a range of core counts under PARSEC benchmarks, ReCoST is found to enjoy 3.21 (or 2.64 $_$\times$_$ ) more efficiency in directory storage than conventional bit-tracking directories (or the best directory known so far, called SCD) for a 64-core CMP under monotasking (or multitasking) workloads while ensuring execution slowdowns to stay within 2.4 percent (or 3.3 percent). $_$\times$_$
Coherence, Benchmark testing, Multitasking, Message systems, Kernel, Radiation detectors, Parallel processing
W. Shu and N. Tzeng, "Compressed Sharer Tracking and Relinquishment Coherence for Superior Directory Efficiency of Chip Multiprocessors," in IEEE Transactions on Computers, vol. 66, no. 11, pp. 1975-1981, 2017.