Improving Flash-Based Disk Cache with Lazy Adaptive Replacement

Citations Over TimeTop 10% of 2016 papers

Abstract

For years, the increasing popularity of flash memory has been changing storage systems. Flash-based solid-state drives (SSDs) are widely used as a new cache tier on top of hard disk drives (HDDs) to speed up data-intensive applications. However, the endurance problem of flash memory remains a concern and is getting worse with the adoption of MLC and TLC flash. In this article, we propose a novel cache management algorithm for flash-based disk cache named Lazy Adaptive Replacement Cache (LARC). LARC adopts the idea of selective caching to filter out seldom accessed blocks and prevent them from entering cache. This avoids cache pollution and preserves popular blocks in cache for a longer period of time, leading to a higher hit rate. Meanwhile, by avoiding unnecessary cache replacements, LARC reduces the volume of data written to the SSD and yields an SSD-friendly access pattern. In this way, LARC improves the performance and endurance of the SSD at the same time. LARC is self-tuning and incurs little overhead. It has been extensively evaluated by both trace-driven simulations and synthetic benchmarks on a prototype implementation. Our experiments show that LARC outperforms state-of-art algorithms for different kinds of workloads and extends SSD lifetime by up to 15.7 times.

Related Papers

• → Location cache(2004)28 cited
• → Hybrid-way Cache for Mobile Processors(2011)3 cited
• → Composite Pseudo-Associative Cache for Mobile Processors(2010)2 cited
• Research of data cache technology based on cache-network(2004)
• → An Efficient Cache Grouping Strategy for Multinode Cache Networks(2015)