| Write amplification analysis in flash-based solid state drives |
| Full text |
Pdf
(329 KB)
|
| Source
|
ACM International Conference Proceeding Series
archive
Proceedings of SYSTOR 2009: The Israeli Experimental Systems Conference
table of contents
Haifa, Israel
SESSION: Storage
table of contents
Article No. 10
Year of Publication: 2009
ISBN:978-1-60558-623-6
|
|
Authors
|
|
Xiao-Yu Hu
|
IBM Zurich Research Laboratory, Rüschlikon, Switzerland
|
|
Evangelos Eleftheriou
|
IBM Zurich Research Laboratory, Rüschlikon, Switzerland
|
|
Robert Haas
|
IBM Zurich Research Laboratory, Rüschlikon, Switzerland
|
|
Ilias Iliadis
|
IBM Zurich Research Laboratory, Rüschlikon, Switzerland
|
|
Roman Pletka
|
IBM Zurich Research Laboratory, Rüschlikon, Switzerland
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 45, Downloads (12 Months): 169, Citation Count: 0
|
|
|
ABSTRACT
Write amplification is a critical factor limiting the random write performance and write endurance in storage devices based on NAND-flash memories such as solid-state drives (SSD). The impact of garbage collection on write amplification is influenced by the level of over-provisioning and the choice of reclaiming policy. In this paper, we present a novel probabilistic model of write amplification for log-structured flash-based SSDs. Specifically, we quantify the impact of over-provisioning on write amplification analytically and by simulation assuming workloads of uniformly-distributed random short writes. Moreover, we propose modified versions of the greedy garbage-collection reclaiming policy and compare their performance. Finally, we analytically evaluate the benefits of separating static and dynamic data in reducing write amplification, and how to address endurance with proper wear leveling.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Nitin Agrawal , Vijayan Prabhakaran , Ted Wobber , John D. Davis , Mark Manasse , Rina Panigrahy, Design tradeoffs for SSD performance, USENIX 2008 Annual Technical Conference on Annual Technical Conference, p.57-70, June 22-27, 2008, Boston, Massachusetts
|
| |
2
|
|
 |
3
|
|
 |
4
|
|
| |
5
|
P. Erdös and A. Rényi. On a classical problem of probability theory. Magyar Tud. Akad. Mat. Kutato Int. Kozl, 6:215--219, 1961.
|
| |
6
|
A. Fazio. The real story about NAND flash and solid-state drive reliability. Intel Developer Forum US, Aug. 2008.
|
| |
7
|
|
| |
8
|
E. H. McKinney. Generalized birthday problem. American Mathematical Monthly, (73):385--387, 1966.
|
| |
9
|
|
| |
10
|
J. Menon and L. Stockmeyer. An age-threshold algorithm for garbage collection in log-structured arrays and file systems. In J. Schaeffler, editor, High Performance Computing Systems and Applications, pages 119--132. Kluwer Academic Publishers, 1998.
|
| |
11
|
ONFi. Open NAND Flash Interface Specification 1.0. Specification, Open NAND Flash Interface (ONFi), Dec. 2006.
|
 |
12
|
|
 |
13
|
|
| |
14
|
D. Shmidt. TrueFFS wear-leveling mechanism. Technical report, M-Systems, May 2002.
|
| |
15
|
Stec. The ZeusIOPS enterprise SSD.
|
| |
16
|
D. Woodhouse. JFFS: The journaling flash file system. In Ottawa Linux Symposium, July 2001.
|
|