The SBM: A Victim Block Selection Method Based on Min-heap Priority Queues

NAND flash memories are widely utilized in embedded systems. However, these memories limited endurance leads to the reduced reliability of flash storage devices. The NAND flash blocks reclamation policy plays a substantial role in its lifetime degradation. The Scoring Based Method (SBM) aims to address this problem. This paper employs priority queues based on a min-heap structure to enhance the lifetime of NAND flash chips in an SSD. The blocks are ordered in the corresponding min-heap based on the factors which directly affect the lifespan of flash blocks. Experiments were conducted using the SSDsim simulation tool. Moreover, the method is evaluated under both write-intensive and read-intensive workloads. The results demonstrate that the SBM enhances the lifetime by at least 2.5 percent compared to its earlier version, and 39.9 percent compared to the rest of the methods.

[1]  Ruei-Chuan Chang,et al.  Cleaning policies in mobile computers using flash memory , 1999, J. Syst. Softw..

[2]  Andrea L. Lacaita,et al.  Reviewing the Evolution of the NAND Flash Technology , 2017, Proceedings of the IEEE.

[3]  Raymond H. Myers,et al.  Probability and Statistics for Engineers and Scientists. , 1973 .

[5]  Yuan-Hao Chang,et al.  Efficient Victim Block Selection for Flash Storage Devices , 2015, IEEE Transactions on Computers.

[6]  Tao Xie,et al.  PCFTL: A Plane-Centric Flash Translation Layer Utilizing Copy-Back Operations , 2015, IEEE Transactions on Parallel and Distributed Systems.

[7]  Hong Jiang,et al.  Performance impact and interplay of SSD parallelism through advanced commands, allocation strategy and data granularity , 2011, ICS '11.

[8]  Chin-Hsien Wu,et al.  Rethink the Design of Flash Translation Layers in a Component-Based View , 2017, IEEE Access.

[9]  Hamid Sarbazi-Azad,et al.  Performance Evaluation of Dynamic Page Allocation Strategies in SSDs , 2016, ACM Trans. Model. Perform. Evaluation Comput. Syst..

[10]  Jin-Soo Kim,et al.  Zombie Chasing: Efficient Flash Management Considering Dirty Data in the Buffer Cache , 2015, IEEE Transactions on Computers.

[11]  Jong Wook Kwak,et al.  Garbage Collection Technique using Erasure Interval for NAND Flash Memory-based Storage Systems , 2016 .

[12]  Lei Yao,et al.  A workload-aware flash translation layer enhancing performance and lifespan of TLC/SLC dual-mode flash memory in embedded systems , 2017, Microprocess. Microsystems.

[13]  Chundong Wang,et al.  Observational wear leveling: An efficient algorithm for flash memory management , 2012, DAC Design Automation Conference 2012.

[14]  Neal R. Mielke,et al.  Reliability of Solid-State Drives Based on NAND Flash Memory , 2017, Proceedings of the IEEE.

[15]  Dong-Ho Lee,et al.  A wear-leveling algorithm exploiting k-bitwise operations for flash storage devices , 2015, IEEE Transactions on Consumer Electronics.

[16]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[17]  Seyyed Amir Asghari,et al.  A novel method for victim block selection for NAND flash-based solid state drives based on scoring , 2020, The Journal of Supercomputing.

[18]  Tei-Wei Kuo,et al.  Reducing Data Migration Overheads of Flash Wear Leveling in a Progressive Way , 2016, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.