TL;DR
LeaFTL introduces a learning-based approach for SSD flash translation layers that dynamically adapts address mapping using linear regression, reducing memory use and enhancing performance.
Contribution
It presents LeaFTL, a novel FTL that employs linear regression for adaptive address mapping, significantly reducing memory footprint and improving SSD performance.
Findings
Memory footprint reduced by 2.9x on average
Storage performance improved by 1.4x on average
Effectiveness demonstrated across various workloads
Abstract
In modern solid-state drives (SSDs), the indexing of flash pages is a critical component in their storage controllers. It not only affects the data access performance, but also determines the efficiency of the precious in-device DRAM resource. A variety of address mapping schemes and optimization techniques have been proposed. However, most of them were developed with human-driven heuristics. They cannot automatically capture diverse data access patterns at runtime in SSD controllers, which leaves a large room for improvement. In this paper, we present a learning-based flash translation layer (FTL), named LeaFTL, which learns the address mapping to tolerate dynamic data access patterns via linear regression at runtime. By grouping a large set of mapping entries into a learned segment, it significantly reduces the memory footprint of the address mapping table, which further benefits the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
