Abstract
Solid state drives have been widely applied in modern computer systems. The lifetime of the SSD depends heavily on the efficiency of the implementation of the garbage collection (GC) algorithm that reclaims previously used pages. In this paper, we present the first detailed proof that the greedy GC algorithm has the optimal performance (minimized write amplification) for memoryless workloads.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Critical Data Backup with Hybrid Flash-Based Consumer Devices;ACM Transactions on Architecture and Code Optimization;2023-12-15
2. Performance Characterization of NVMe Flash Devices with Zoned Namespaces (ZNS);2023 IEEE International Conference on Cluster Computing (CLUSTER);2023-10-31
3. Offline and Online Algorithms for SSD Management;Communications of the ACM;2023-06-22
4. On the Cost of Near-Perfect Wear Leveling in Flash-Based SSDs;ACM Transactions on Modeling and Performance Evaluation of Computing Systems;2023-04-12
5. MGC: Multiple-Gray-Code for 3D NAND Flash based High-Density SSDs;2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA);2023-02