Write amplification analysis in flash-based solid state drives
By Xiao-Yu Hu, Evangelos Eleftheriou, R. Haas, I. Iliadis, Roman A. Pletka. Annual Haifa Experimental Systems Conference, 2009
358 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/91912a461d30035639ddda2b6de97a388823fb4b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Computer Networks and Communications
- Onur Mutlu
- Yixin Luo
- Saugata Ghose
- Yu Cai
- Erich F. Haratsch
- Anand Sivasubramaniam
- Sudipta Sengupta
- Amitabha Roy
Citations in the corpus
- Error Characterization, Mitigation, and Recovery in Flash-Memory-Based Solid-State Drives (2017, methodology): “For a greedy garbage collection algorithm and a random-access workload, the correlation between WA and OP can be calculated [48, 67], as shown in Figure 5.”
- X-Stream: edge-centric graph processing using streaming partitions (2013, background): “All X-Stream writes are sequential and therefore avoid the problem of write amplification [34], in a manner similar to log-structured filesystems [52] and memory allocators built specifically for flash devices [16].”
- SSD Failures in Datacenters: What? When? and Why? (2016, background): “Reallocations result in reduction of reserve space, which plays an important role in reducing write amplification and wear-leveling [17].”
- The Bw-Tree: A B-tree for new hardware platforms (2013, background): “While flash has fast random and sequential reads, it needs an erase cycle prior to write, making random writes slower than sequential writes [7].”