Affiliation:
1. Northeastern University
Abstract
Solid-state drives (SSDs) update data by writing a new copy, rather than overwriting old data, causing prior copies of the same data to be
invalidated
. These writes are performed in units of
pages
, while space is reclaimed in units of multipage
erase blocks
, necessitating copying of any remaining valid pages in the block before reclamation. The efficiency of this cleaning process greatly affects performance under random workloads; in particular, in SSDs, the write bottleneck is typically internal media throughput, and
write amplification
due to additional internal copying directly reduces application throughput.
We present the first nearly-exact closed-form solution for write amplification under greedy cleaning for uniformly-distributed random traffic, validate its accuracy via simulation, and show that its inaccuracies are negligible for reasonable block sizes and overprovisioning ratios. In addition, we also present the first models which predict performance degradation for both LRW (least-recently-written) cleaning and greedy cleaning under simple nonuniform traffic conditions; simulation results show the first model to be exact and the second to be accurate within 2%. We extend the LRW model to arbitrary combinations of random traffic and demonstrate its use in predicting cleaning performance for real-world workloads.
Using these analytic models, we examine the strategy of separating “hot” and “cold” data, showing that for our traffic model, such separation eliminates any loss in performance due to nonuniform traffic. We then show how a system which segregates hot and cold data into different block pools may shift free space between these pools in order to achieve improved performance, and how numeric methods may be used with our model to find the optimum operating point, which approaches a write amplification of 1.0 for increasingly skewed traffic. We examine online methods for achieving this optimal operating point and show a control strategy based on our model which achieves high performance for a number of real-world block traces.
Funder
Division of Computer and Network Systems
International Business Machines Corporation
Publisher
Association for Computing Machinery (ACM)
Subject
Hardware and Architecture
Reference35 articles.
1. Ban A. 2004. Wear leveling of static areas in flash memory. U.S. Patent 6 732 221 filed June 1 2001 and issued May 4 2004. Ban A. 2004. Wear leveling of static areas in flash memory. U.S. Patent 6 732 221 filed June 1 2001 and issued May 4 2004.
2. Bates K. and McNutt B. 2007. OLTP Application I/O. UMass Trace Repository. http://traces.cs.umass.edu. Bates K. and McNutt B. 2007. OLTP Application I/O. UMass Trace Repository. http://traces.cs.umass.edu.
3. Competitive Analysis of Flash-Memory Algorithms
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Excessive SSD-Internal Parallelism Considered Harmful;Proceedings of the 15th ACM Workshop on Hot Topics in Storage and File Systems;2023-07-09
2. Offline and Online Algorithms for SSD Management;Communications of the ACM;2023-06-22
3. On the Cost of Near-Perfect Wear Leveling in Flash-Based SSDs;ACM Transactions on Modeling and Performance Evaluation of Computing Systems;2023-04-12
4. ZNSwap: un-Block your Swap;ACM Transactions on Storage;2023-03-06
5. Improving the Endurance of Next Generation SSD’s using WOM-v Codes;ACM Transactions on Storage;2022-11-30