Lightweight Data Lifetime Classification using Migration Counts to Improve Performance and Lifetime of Flash-based SSDs
- Authors
- Park, Hyunseung; Lee, Eunjae; Kim, Jaeho; Noh, Sam H.
- Issue Date
- 2021
- Publisher
- ASSOC COMPUTING MACHINERY
- Keywords
- SSD; flash memory; data lifetime; migration count; WAF
- Citation
- APSYS '21: PROCEEDINGS OF THE 12TH ACM SIGOPS ASIA-PACIFIC WORKSHOP ON SYSTEMS, pp.25 - 33
- Indexed
- SCOPUS
- Journal Title
- APSYS '21: PROCEEDINGS OF THE 12TH ACM SIGOPS ASIA-PACIFIC WORKSHOP ON SYSTEMS
- Start Page
- 25
- End Page
- 33
- URI
- https://scholarworks.bwise.kr/gnu/handle/sw.gnu/5707
- DOI
- 10.1145/3476886.3477520
- Abstract
- This paper presents a policy that effectively classifies data in solid state drives (SSDs) based on their lifetime to reduce write amplification of flash based storage. Although there have been many existing studies for separating data by their lifetime or hotness, they either require hardware interface support or create nontrivial management overhead. In particular, the recently proposed multi-stream technique has a limitation in that data streams must be given by the host. Moreover, data stream separation requires user program implementation or additional computations. In this paper, we propose MiDA (Migration count based Data Age classification), a lightweight and effective data lifetime separation policy. Specifically, it exploits data movement patterns of flash memory blocks so that it can be classified effectively with only negligible overhead. It is implemented at the storage device level, lifting the need for any modification on the host. Using various synthesized and real world database workloads, we evaluate the proposed technique on FEMU, an NVMe SSD emulator. We find that it improves both the performance and lifetime of flash based SSDs.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - 공과대학 > Department of Aerospace and Software Engineering > Journal Articles

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