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.98× 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.

Sungkyunkwan University in 2014. Thereafter, he worked for Samsung Electronics as a SoC verification engineer until 2018. After that, he began to pursue his Master's degree at Cornell University in the Department of Electrical and Computer Engineering, with a focus on hardware memory compression.