Hesaurus: Eicient cache compression via dynamic clustering

Abstract

In this paper, we identify a previously untapped source of compressibility in cache working sets: clusters of cachelines that are similar, but not identical, to one another. To compress the cache, we can then store the lclusteroid” of each cluster together with the (much smaller) ldifs” needed to reconstruct the rest of the cluster. To exploit this opportunity, we propose a hardware-level on-line cacheline clustering mechanism based on locality-sensitive hashing. Our method dynamically forms clusters as they appear in the data access stream and retires them as they disappear from the cache. Our evaluations show that we achieve 2.25× compression on average (and up to 9.9×) on SPEC CPU 2017 suite and is signiicantly higher than prior proposals scaled to an iso-silicon budget.