File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

노삼혁

Noh, Sam H.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Alleviating Garbage Collection Interference Through Spatial Separation in All Flash Arrays

Author(s)
Kim, JaehoLim, KwanghyunJung, YoungdonKee, SungjinMin, ChangwooNoh, Sam H.
Issued Date
2019-07-10
URI
https://scholarworks.unist.ac.kr/handle/201301/79507
Fulltext
https://www.usenix.org/conference/atc19/presentation/kim-jaeho
Citation
USENIX Annual Technical Conference
Abstract
We present SWAN, a novel All Flash Array (AFA) management scheme. Recent flash SSDs provide high I/O bandwidth (e.g., 3-10GB/s) so the storage bandwidth can easily surpass the network bandwidth by aggregating a few SSDs. However, it is still challenging to unlock the full performance of SSDs. The main source of performance degradation is garbage collection (GC). We find that existing AFA designs are susceptible to GC at SSD-level and AFA software-level. In designing SWAN, we aim to alleviate the performance interference caused by GC at both levels. Unlike the commonly used temporal separation approach that performs GC at idle time, we take a spatial separation approach that partitions SSDs into the front-end SSDs dedicated to serve write requests and the back-end SSDs where GC is performed. Compared to temporal separation of GC and application I/O, which is hard to be controlled by AFA software, our approach guarantees that the storage bandwidth always matches the full network performance without being interfered by AFA-level GC. Our analytical model confirms this if the size of front-end SSDs and the back-end SSDs are properly configured. We provide extensive evaluations that show SWAN is effective for a variety of workloads.
Publisher
USENIX Association

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.