BCD Deduplication: Effective Memory Compression Using Partial Cache-Line Deduplication
This thesis identifies new partial data redundancy among multiple cache lines that cannot be exploited by traditional cache-line compression or memory deduplication. Also, this thesis proposes BCD deduplication that effectively utilizes the partial matches among cache lines through a novel combination of compression and deduplication to increase the effective capacity of both LLC and main memory. Experimental results show that BCD deduplication achieves the average compression ratio of 1.98x for SPEC2006, TPC-DS, and TPC-H, which is 39.4% higher than a straightforward combination of the state-of-the-art cache-line-granularity compression and memory deduplication. This work also presents an efficient implementation in modern memory hierarchy along with optimizations and show that BCD deduplication also improves performance by 4.21% on average for the SPEC2006 benchmarks.