Austere Flash Caching with Deduplication and Compression
Austere Flash Caching with Deduplication and Compression
复制标题
DOI：
--
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Qiuping Wang;Jinhong Li;Wen Xia;E. Kruus;Biplob K. Debnath;P. Lee
中科院分区：
文献类型：
--
作者：
Qiuping Wang;Jinhong Li;Wen Xia;E. Kruus;Biplob K. Debnath;P. Lee
现代存储系统利用闪存缓存来提高I/O性能，面对不断增长的数据密集型工作负载，提高闪存缓存的空间效率和耐用性仍然是一个关键但具有挑战性的问题。重复数据删除和压缩是很有前途的数据减少技术，可以通过删除重复内容来节省存储和I/O，但是它们也会为索引管理带来大量的内存开销。我们提出了AustereCache，这是一种新的闪存缓存设计，旨在实现内存高效索引，同时保留重复数据删除和压缩的数据减少优势。AustereCache强调严格的缓存管理，并提出了不同的核心技术来实现高效的数据组织和缓存替换，从而尽可能多地消除索引元数据，并使轻量级的内存索引结构可行。跟踪驱动的实验表明，与支持重复数据删除和压缩的最先进的闪存缓存设计相比，我们的AustereCache原型节省了69.9-97.0%的内存使用，同时保持了相当的读命中率和写减少率，并实现了高I/O吞吐量。
Modern storage systems leverage flash caching to boost I/O performance, and enhancing the space efficiency and endurance of flash caching remains a critical yet challenging issue in the face of ever-growing data-intensive workloads. Deduplication and compression are promising data reduction techniques for storage and I/O savings via the removal of duplicate content, yet they also incur substantial memory overhead for index management. We propose AustereCache, a new flash caching design that aims for memory-efficient indexing, while preserving the data reduction benefits of deduplication and compression. AustereCache emphasizes austere cache management and proposes different core techniques for efficient data organization and cache replacement, so as to eliminate as much indexing metadata as possible and make lightweight in-memory index structures viable. Trace-driven experiments show that our AustereCache prototype saves 69.9-97.0% of memory usage compared to the state-of-the-art flash caching design that supports deduplication and compression, while maintaining comparable read hit ratios and write reduction ratios and achieving high I/O throughput.