Publication
Title
On the endurance of the d-Choices garbage collection algorithm for flash-based SSDs
Author
Abstract
Garbage collection (GC) algorithms for flash-based solid-state drives (SSDs) have a profound impact on its performance and many studies have focused on assessing the so-called write amplification of various GC algorithms. In this article, we consider the family of d-choices GC algorithms and study (a) the extent in which these algorithms induce unequal wear and (b) the manner in which they affect the lifetime of the drive. For this purpose, we introduce two performance measures: PE fairness and SSD endurance. We study the impact of the d-choices GC algorithm on both these measures under different workloads (uniform, synthetic and tracebased) when combined with two different write modes. Numerical results show that the more complex of the two write modes, which requires hot/cold data identification, may not necessarily give rise to a significantly better SSD endurance. Further, the d-choices GC algorithm is often shown to strike a good balance between garbage collection and wear leveling for small d values (e.g., d = 10), yielding high endurance.
Language
English
Source (journal)
ACM transactions on modeling and performance evaluation of computing systems. - New York, NY, 2015, currens
SYSTEMS
Publication
New York, NY : Association for Computing Machinery, Inc , 2019
ISSN
2376-3639
DOI
10.1145/3326121
Volume/pages
4 :3 (2019) , 23 p.
Article Reference
UNSP 13
ISI
000497124600001
Medium
E-only publicatie
Full text (Publisher's DOI)
Full text (publisher's version - intranet only)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identifier
Creation 09.12.2019
Last edited 28.08.2024
To cite this reference