CATDOG: Cost-Age-Time Data Organized Garbage Collection

This paper proposes the Cost-Age-Time Data Organized Garbage Collection (CATDOG) scheme, which clusters data based on their update frequencies to reduce the overhead of data migration. It also trades off between endurance and throughput, and efficiently erases multiple blocks to reduce garbage collection latency. To the best of our knowledge, this is the first paper to provide a holistic discussion on the effects of combining all three factors. Our simulation study shows that CATDOG achieves a maximum of 3.54 times higher throughput performance and 1.18 times greater endurance than a selected baseline for a heavy write workload.