TY - GEN
T1 - Taking garbage collection overheads off the critical path in SSDs
AU - Jung, Myoungsoo
AU - Prabhakar, Ramya
AU - Kandemir, Mahmut Taylan
PY - 2012
Y1 - 2012
N2 - Solid state disks (SSDs) have the potential to revolutionize the storage system landscape, mostly due to their good random access performance, compared to hard disks. However, garbage collection (GC) in SSD introduces significant latencies and large performance variations, which renders widespread adoption of SSDs difficult. To address this issue, we present a novel garbage collection strategy, consisting of two components, called Advanced Garbage Collection (AGC) and Delayed Garbage Collection (DGC), that operate collectively to migrate GC operations from busy periods to idle periods. More specifically, AGC is employed to defer GC operations to idle periods in advance, based on the type of the idle periods and on-demand GC needs, whereas DGC complements AGC by handling the collections that could not be handled by AGC. Our comprehensive experimental analysis reveals that the proposed strategies provide stable SSD performance by significantly reducing GC overheads. Compared to the state-of-the-art GC strategies, P-FTL, L-FTL and H-FTL, our AGC+DGC scheme reduces GC overheads, on average, by about 66.7%, 96.7% and 98.2%, respectively.
AB - Solid state disks (SSDs) have the potential to revolutionize the storage system landscape, mostly due to their good random access performance, compared to hard disks. However, garbage collection (GC) in SSD introduces significant latencies and large performance variations, which renders widespread adoption of SSDs difficult. To address this issue, we present a novel garbage collection strategy, consisting of two components, called Advanced Garbage Collection (AGC) and Delayed Garbage Collection (DGC), that operate collectively to migrate GC operations from busy periods to idle periods. More specifically, AGC is employed to defer GC operations to idle periods in advance, based on the type of the idle periods and on-demand GC needs, whereas DGC complements AGC by handling the collections that could not be handled by AGC. Our comprehensive experimental analysis reveals that the proposed strategies provide stable SSD performance by significantly reducing GC overheads. Compared to the state-of-the-art GC strategies, P-FTL, L-FTL and H-FTL, our AGC+DGC scheme reduces GC overheads, on average, by about 66.7%, 96.7% and 98.2%, respectively.
UR - http://www.scopus.com/inward/record.url?scp=84869834570&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84869834570&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-35170-9_9
DO - 10.1007/978-3-642-35170-9_9
M3 - Conference contribution
AN - SCOPUS:84869834570
SN - 9783642351693
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 164
EP - 186
BT - Middleware 2012 - ACM/IFIP/USENIX 13th International Middleware Conference, Proceedings
PB - Springer Verlag
T2 - 13th ACM/IFIP/USENIX International Middleware Conference, Middleware 2012
Y2 - 3 December 2012 through 7 December 2012
ER -