Garbage Collection Algorithms in Flash-Based Solid State Drives release_5wwm57aaljbdrero4kz3mnabsq

Published in VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE by Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP.

2020   Issue 12, p29-33


Solid state drives (SSDs)have emerged as faster and more reliable data storages over the last few years. Their intrinsic characteristics prove them to be more efficient as compared to other traditional storage media such as the Hard Disk Drives (HDDs). Issues such as write amplification, however, degrade the performance and lifespan of an SSD. This issue is in turn handled by the Garbage Collection (GC) algorithms that are put in place to supply free blocks for serving the writes being made to the flash-based SSDs and thus reduce the need of extra unnecessary writes. The LRU/FIFO, Greedy, Windowed Greedy and D choices algorithms have been described to lower write amplification for incoming writes which are different in nature. The performance of the GC algorithms varies based on factors such as pre-defined hot/cold data separation, hotness of data, uniform/non-uniform nature of incoming writes, the GC window size and the number of pages in each block of the flash memory package. Finally, it can be seen that the number of write frontiers so used, can dictate the separation of hot/cold data and increase the performance of a GC algorithm.
In application/xml+jats format

Archived Files and Locations

application/pdf  384.3 kB
file_hneo4ocpajfz7eovrxl3ungeve (publisher) (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2020-10-10
Language   en ?
Journal Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  2278-3075
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 36ef1008-d2ee-4353-906e-b3d0c3e292f8