On-Demand Garbage Collection Algorithm with Prioritized Victim Blocks for SSDs

被引:0
作者
Lee, Hyeyun [1 ]
Choi, Wooseok [1 ]
Hong, Youpyo [1 ]
机构
[1] Dongguk Univ Seoul, Div Elect & Elect Engn, Seoul 04620, South Korea
关键词
flash memory; solid-state drive; garbage collection; PERFORMANCE;
D O I
10.3390/electronics12092142
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Because of their numerous benefits, solid-state drives (SSDs) are increasingly being used in a wide range of applications, including data centers, cloud computing, and high-performance computing. The growing demand for SSDs has led to a continuous improvement in their technology and a reduction in their cost, making them a more accessible storage solution for a wide range of users. Garbage collection (GC) is a process that reclaims wasted storage space in NAND flash memories, which are used as the memory devices for SSDs. However, the GC process can cause performance degradation and lifetime reduction. This paper proposes an efficient garbage collection (GC) scheme that minimizes overhead by invoking GC operations only when necessary. Each GC operation is executed in a specific order based on the expected storage gain and the execution cost, ensuring that the storage space requirement is met while minimizing the frequency of GC invocation. This approach not only reduces the overhead due to GC, but also improves the overall performance of SSDs, including the latency and write amplification factor (WAF) which is an important indicator of the longevity of SSDs.
引用
收藏
页数:14
相关论文
共 42 条
[21]   Is Garbage Collection Overhead Gone? Case study of F2FS on ZNS SSDs [J].
Seo, Dongjoo ;
Chen, Ping-Xiang ;
Li, Huaicheng ;
Bjorling, Matias ;
Dutt, Nikil .
PROCEEDINGS OF THE 2023 15TH ACM WORKSHOP ON HOT TOPICS IN STORAGE AND FILE SYSTEMS, HOTSTORAGE 2023, 2023, :102-108
[22]   Optimizing Garbage Collection for ZNS SSDs via In-storage Data Migration and Address Remapping [J].
Tan, Zhenhua ;
Long, Linbo ;
Shen, Jingcheng ;
Liu, Renping ;
Gao, Congming ;
Zhong, Kan ;
Jiang, Yi .
ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2024, 21 (04)
[23]   LC-CB: Low Computational Victim Selection Policy in Garbage Collection [J].
Han, Jongwoo ;
Jeon, Haejoo ;
Shin, Dongmin ;
Lee, Chang-Gun .
2022 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, ARCHITECTURE AND STORAGE (NAS), 2022, :239-246
[24]   Generational Garbage Collection Algorithm Based on Lifespan Prediction [J].
Xin Ren ;
Ying Zhangxu .
2016 IEEE 4TH INTERNATIONAL CONFERENCE ON FUTURE INTERNET OF THINGS AND CLOUD WORKSHOPS (FICLOUDW), 2016, :183-187
[25]   Mark without much Sweep Algorithm for Garbage Collection [J].
Basch, Danko ;
Ivancic, Dorian ;
Hlupic, Nikica .
AUTOMATIKA, 2014, 55 (04) :514-525
[26]   INDIRECT REFERENCE COUNTING - A DISTRIBUTED GARBAGE COLLECTION ALGORITHM [J].
PIQUER, JM .
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 505 :150-165
[27]   MFGC: Minimal First Garbage Collection for Monitoring of Context-Aware Victim Selection [J].
Shweta ;
Singh, P. K. .
JOURNAL OF ELECTRICAL SYSTEMS, 2024, 20 :92-101
[28]   GCC: Optimizing Space Efficiency and Read Latency of SSDs with Workload-Aware Garbage Collection Aided Compression [J].
Liu, Linhui ;
Gu, Yunfei ;
Zhu, Chenhao ;
Wu, Chentao ;
Li, Jie ;
Guo, Minyi .
2024 IEEE 42ND INTERNATIONAL CONFERENCE ON COMPUTER DESIGN, ICCD, 2024, :332-339
[29]   Analysis of the multi-phase copying garbage collection algorithm [J].
Podhorszki, N .
DISTRIBUTED AND PARALLEL SYSTEMS: CLUSTER AND GRID COMPUTING, 2005, 777 :193-200
[30]   Analysis of the multi-phase copying garbage collection algorithm [J].
Podhorszki, Norbert .
INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2009, 4 (03) :204-212