Jinhua Cui
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jinhua Cui has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Laurence Tianruo Yang
School of Computer Science and Technology, Hainan University, Haikou, China and Department of Computer Science, St. Francis Xavier University, Antigonish, Nova Scotia, Canada
12 shared publications - Jianhang Huang
School of Electronic and Information Engineering, Xian Jiaotong University, Xian, China
5 shared publications Junwei Liu
School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, Hubei, China
4 shared publications- Debin Liu
School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China
3 shared publications - Canghao Wen
Huazhong University of Science and Technology School of Computer Science and Technology
2 shared publications - Jun Yang
Electrical and Computer Engineering Department, University of Pittsburgh, Pittsburgh, PA 15261, USA
2 shared publications
Latest Publications
- Open Access
- 10 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
Seg-FTL: A new Segment-Based FTL with Dynamic Linear Model for Enhanced SSD Performance
Flash translation layer (FTL) plays a crucial role in NAND flash memory-based solid state drives (SSDs), abstracting the complexities of flash memory operations such as address translation, garbage collection, and wear leveling. As flash memory capacities continue to grow, particularly with advancements in 3D flash and high-density flash technology, the challenges associated with efficient FTL design become increasingly prominent. The escalating demand for DRAM space to accommodate the larger address mapping table for FTL in modern SSD, coupled with the performance degradation caused by GC-induced write amplification, necessitates innovative FTL solutions that can optimize both read and write performance while maintaining memory efficiency. In this work, we introduce Seg-FTL, a novel FTL solution to significantly enhance the read and write performance of flash storage system, by integrating the segment-based FTL with a dynamic linear model. The segment-based FTL compresses the contiguous logical page numbers (LPNs) to physical page numbers (PPNs) mappings into segments, allowing more mapping entries to be cached in the limited DRAM. The dynamic linear model synchronously updates with changes in LPN-PPN mapping entries, improving the hit ratio for read requests, especially random reads. Furthermore, a novel dynamic memory allocation scheme is designed for the mapping cache, minimizing fragmentation and enhancing security in memory-constrained embedded systems. The results show that Seg-FTL achieves average performance improvements of 1.10 × to 3.81 × in standard benchmarks, and peak gains of up to 9.37 × under high-concurrency scenarios, compared with the state-of-the-art FTLs.
- 10 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
Open AccessSeg-FTL: A new Segment-Based FTL with Dynamic Linear Model for Enhanced SSD Performance
Flash translation layer (FTL) plays a crucial role in NAND flash memory-based solid state drives (SSDs), abstracting the complexities of flash memory operations such as address translation, garbage collection, and wear leveling. As flash memory capacities continue to grow, particularly with advancements in 3D flash and high-density flash technology, the challenges associated with efficient FTL design become increasingly prominent. The escalating demand for DRAM space to accommodate the larger address mapping table for FTL in modern SSD, coupled with the performance degradation caused by GC-induced write amplification, necessitates innovative FTL solutions that can optimize both read and write performance while maintaining memory efficiency. In this work, we introduce Seg-FTL, a novel FTL solution to significantly enhance the read and write performance of flash storage system, by integrating the segment-based FTL with a dynamic linear model. The segment-based FTL compresses the contiguous logical page numbers (LPNs) to physical page numbers (PPNs) mappings into segments, allowing more mapping entries to be cached in the limited DRAM. The dynamic linear model synchronously updates with changes in LPN-PPN mapping entries, improving the hit ratio for read requests, especially random reads. Furthermore, a novel dynamic memory allocation scheme is designed for the mapping cache, minimizing fragmentation and enhancing security in memory-constrained embedded systems. The results show that Seg-FTL achieves average performance improvements of 1.10 × to 3.81 × in standard benchmarks, and peak gains of up to 9.37 × under high-concurrency scenarios, compared with the state-of-the-art FTLs.
- 20 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45 (1) , 69-82
WOM-FTL: An Efficient FTL for High-Density Flash Memory Through WOM-v Codes
High-density NAND flash memory, such as quadruple-level cell (QLC) flash, has has been widely adopted in emerging storage systems. However, its limited endurance and performance challenges necessitate novel solutions. Voltage-based write-once memory (WOM-v) codes have demonstrated their effectiveness in extending flash memory lifespan by reducing the erase count of flash blocks. Concurrently, secure deletion is essential to ensure data privacy in flash-based storage systems. Existing secure deletion approaches—encryption-based, erasure-based, and scrubbing-based—often face limitations such as susceptibility to deciphering or significant performance overheads. Additionally, the inherent “big block problem” in high-density flash memory complicates garbage collection (GC), further degrading system performance. To address these challenges, this paper proposes WOM-FTL, a flash translation layer (FTL) that integrates secure deletion and garbage collection (GC) with WOM-v codes to enhance both security and performance. WOM-FTL classifies request data into four categories based on access frequency and privacy requirements: hot-secure (HS), cold-secure (CS), hot-unsecure (HU) and cold-unsecure (CU). Additionally, WOM-FTL divides each block into several equal-sized sub-blocks and further classifies them into top sub-blocks and bottom sub-blocks according to their data storage characteristics. When a secure data deletion command is issued to the storage device, WOM-FTL leverages unsecure data (HU and CU) to overwrite the secure data (HS and CS). Furthermore, WOM-FTL allocates different types of request data to the corresponding sub-blocks, creating a data allocation pattern that is both scrubbing-friendly and GC-friendly. Experimental results demonstrate that WOM-FTL improves the I/O performance of storage systems by 60.91% compared to state-of-the-art solutions, providing a significant advancement in secure and efficient management of high-density flash memory.
- 20 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45 (1) , 69-82
WOM-FTL: An Efficient FTL for High-Density Flash Memory Through WOM-v Codes
High-density NAND flash memory, such as quadruple-level cell (QLC) flash, has has been widely adopted in emerging storage systems. However, its limited endurance and performance challenges necessitate novel solutions. Voltage-based write-once memory (WOM-v) codes have demonstrated their effectiveness in extending flash memory lifespan by reducing the erase count of flash blocks. Concurrently, secure deletion is essential to ensure data privacy in flash-based storage systems. Existing secure deletion approaches—encryption-based, erasure-based, and scrubbing-based—often face limitations such as susceptibility to deciphering or significant performance overheads. Additionally, the inherent “big block problem” in high-density flash memory complicates garbage collection (GC), further degrading system performance. To address these challenges, this paper proposes WOM-FTL, a flash translation layer (FTL) that integrates secure deletion and garbage collection (GC) with WOM-v codes to enhance both security and performance. WOM-FTL classifies request data into four categories based on access frequency and privacy requirements: hot-secure (HS), cold-secure (CS), hot-unsecure (HU) and cold-unsecure (CU). Additionally, WOM-FTL divides each block into several equal-sized sub-blocks and further classifies them into top sub-blocks and bottom sub-blocks according to their data storage characteristics. When a secure data deletion command is issued to the storage device, WOM-FTL leverages unsecure data (HU and CU) to overwrite the secure data (HS and CS). Furthermore, WOM-FTL allocates different types of request data to the corresponding sub-blocks, creating a data allocation pattern that is both scrubbing-friendly and GC-friendly. Experimental results demonstrate that WOM-FTL improves the I/O performance of storage systems by 60.91% compared to state-of-the-art solutions, providing a significant advancement in secure and efficient management of high-density flash memory.
- 15 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 71 (1) , 2175-2185
Tensor-Empowered Hardware-Friendly Lightweight Deep Neural Networks for Vehicular Edge Computing
The high memory footprint, high computational overhead and high power consumption of deep neural networks are the main bottlenecks in deploying network models to vehicular edge devices. Furthermore, in the collaborative learning process, the large number of training parameters can cause high communication overhead between the vehicular edge devices and the cloud. The redundant floating-point operations and training parameters are the main “culprits" for these bottlenecks. To solve the above problems, we propose the lightweight tensor linear shift layer and the lightweight tensor convolutional shift layer, and two models based on the lightweight tensor shift layer, LTS-α and LTS-β are proposed. Firstly, the weight matrix and weight tensor in the network model are represented in the form of a chain-structured weight tensor kernel; secondly, fewer bits are used to represent the values in the weight tensor kernel; finally, the floating-point multiplication operations in the network model are replaced with inexpensive sign flipping and bitwise shift, as a way to reduce the amount of floating-point computation and memory footprint in the deep neural network model, and to speed up the training and inference process of the model, thereby reducing the power consumption of the model at runtime. To evaluate the superiority of our proposed model, we conduct experiments on several real datasets and compare them with the relevant mainstream method. The experimental results show that both our proposed LTS-α and LTS-β can achieve comparable or even higher performance on real tasks than the relevant mainstream method. Moreover, LTS-α and LTS-β have a lower memory footprint and computational overhead than relevant mainstream methods, and the training process and inference process of the models consume less energy. Therefore, LTS-α and LTS-β are more suitable for deployment to resource-constrained vehicular edge devices to provide more general intelligence services.
- 15 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 71 (1) , 2175-2185
Tensor-Empowered Hardware-Friendly Lightweight Deep Neural Networks for Vehicular Edge Computing
The high memory footprint, high computational overhead and high power consumption of deep neural networks are the main bottlenecks in deploying network models to vehicular edge devices. Furthermore, in the collaborative learning process, the large number of training parameters can cause high communication overhead between the vehicular edge devices and the cloud. The redundant floating-point operations and training parameters are the main “culprits" for these bottlenecks. To solve the above problems, we propose the lightweight tensor linear shift layer and the lightweight tensor convolutional shift layer, and two models based on the lightweight tensor shift layer, LTS-α and LTS-β are proposed. Firstly, the weight matrix and weight tensor in the network model are represented in the form of a chain-structured weight tensor kernel; secondly, fewer bits are used to represent the values in the weight tensor kernel; finally, the floating-point multiplication operations in the network model are replaced with inexpensive sign flipping and bitwise shift, as a way to reduce the amount of floating-point computation and memory footprint in the deep neural network model, and to speed up the training and inference process of the model, thereby reducing the power consumption of the model at runtime. To evaluate the superiority of our proposed model, we conduct experiments on several real datasets and compare them with the relevant mainstream method. The experimental results show that both our proposed LTS-α and LTS-β can achieve comparable or even higher performance on real tasks than the relevant mainstream method. Moreover, LTS-α and LTS-β have a lower memory footprint and computational overhead than relevant mainstream methods, and the training process and inference process of the models consume less energy. Therefore, LTS-α and LTS-β are more suitable for deployment to resource-constrained vehicular edge devices to provide more general intelligence services.
- 10 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 43 (10) , 2972-2977
Optimizing Secure Deletion in Interlaced Magnetic Recording With Move-on-Cover Approach
Secure deletion plays a crucial role in safeguarding privacy and maintaining confidentiality. Historically, secure deletion was achieved on magnetic storage devices by data overwriting. However, with the rapid advancements in magnetic storage technology, existing secure deletion strategies are still oblivious to the unique characteristics of these storage devices. As a result, there is currently a lack of research effectively addressing the implementation of secure deletion for the emerging interlaced magnetic recording (IMR) technology. Regrettably, applying traditional read-modify-write (RMW) processes to enable secure deletion on IMR technology leads to significant challenges, such as severe write amplification (WA) and performance degradation. In this article, we propose move-on-cover (MOC), a novel secure deletion strategy for securely deleting on IMR, to optimize the performance of secure deletion. Specifically, when securely deleting a bottom track, the MOC first moves one of affected top track to a free top track, and then covers the to-be-deleted bottom track with another top track, minimizing redundant data backups and hiding secure deletion latency of bottom tracks. A series of evaluation experiments show that MOC is highly effective in reducing extra I/Os and improving the performance of secure deletion.
- 10 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 43 (10) , 2972-2977
Optimizing Secure Deletion in Interlaced Magnetic Recording With Move-on-Cover Approach
Secure deletion plays a crucial role in safeguarding privacy and maintaining confidentiality. Historically, secure deletion was achieved on magnetic storage devices by data overwriting. However, with the rapid advancements in magnetic storage technology, existing secure deletion strategies are still oblivious to the unique characteristics of these storage devices. As a result, there is currently a lack of research effectively addressing the implementation of secure deletion for the emerging interlaced magnetic recording (IMR) technology. Regrettably, applying traditional read-modify-write (RMW) processes to enable secure deletion on IMR technology leads to significant challenges, such as severe write amplification (WA) and performance degradation. In this article, we propose move-on-cover (MOC), a novel secure deletion strategy for securely deleting on IMR, to optimize the performance of secure deletion. Specifically, when securely deleting a bottom track, the MOC first moves one of affected top track to a free top track, and then covers the to-be-deleted bottom track with another top track, minimizing redundant data backups and hiding secure deletion latency of bottom tracks. A series of evaluation experiments show that MOC is highly effective in reducing extra I/Os and improving the performance of secure deletion.
- 19 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (3) , 2574-2585
An Efficient Tensor-Based Transformer for Industrial Internet of Things
Transformer and its derivatives are widely used in industrial internet of things due to their excellent performance. However, the scale of these network models is exceptionally large, generating significant memory overhead and computational load during training and inference, as well as consuming large amounts of power resources. Therefore, these existing network models cannot be trained and deployed on resource-constrained industrial embedded devices, thus limiting their participation in collaborative computing and real-time applications. In this paper, we design plug-and-play lightweight multi-head attention and lightweight position-wise feed-forward networks, and propose lightweight tensorized transformer and lightweight tensorized transformer++ based on these two components. The performance of lightweight tensorized transformer and lightweight tensorized transformer++ is evaluated on real datasets. The experimental results show that efficient and lightweight tensor-coupled models can achieve comparable or even higher performance than the transformer on real tasks. Furthermore, the number of training parameters and floating-point operations for lightweight tensorized transformer and lightweight tensorized transformer++ are much lower than the transformer model, and the training time and power consumption of the model during training are also less than the transformer. Therefore, these two lightweight network models are better suited than the transformer for deployment to resource-constrained industrial embedded devices.
- 19 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (3) , 2574-2585
An Efficient Tensor-Based Transformer for Industrial Internet of Things
Transformer and its derivatives are widely used in industrial internet of things due to their excellent performance. However, the scale of these network models is exceptionally large, generating significant memory overhead and computational load during training and inference, as well as consuming large amounts of power resources. Therefore, these existing network models cannot be trained and deployed on resource-constrained industrial embedded devices, thus limiting their participation in collaborative computing and real-time applications. In this paper, we design plug-and-play lightweight multi-head attention and lightweight position-wise feed-forward networks, and propose lightweight tensorized transformer and lightweight tensorized transformer++ based on these two components. The performance of lightweight tensorized transformer and lightweight tensorized transformer++ is evaluated on real datasets. The experimental results show that efficient and lightweight tensor-coupled models can achieve comparable or even higher performance than the transformer on real tasks. Furthermore, the number of training parameters and floating-point operations for lightweight tensorized transformer and lightweight tensorized transformer++ are much lower than the transformer model, and the training time and power consumption of the model during training are also less than the transformer. Therefore, these two lightweight network models are better suited than the transformer for deployment to resource-constrained industrial embedded devices.
- 1 December 2022
- Published by Springer Nature
- p. 267-273
IMRSim: A Disk Simulator for Interlaced Magnetic Recording Technology
- 1 December 2022
- Published by Springer Nature
- p. 267-273
IMRSim: A Disk Simulator for Interlaced Magnetic Recording Technology
- 11 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 34 (1) , 383-399
A Space-Efficient Fair Cache Scheme Based on Machine Learning for NVMe SSDs
Non-volatile memory express (NVMe) solid-state drives (SSDs) have been widely adopted in multi-tenant cloud computing environments or multi-programming systems. The on-board DRAM cache inside NVMe SSDs can efficiently reduce the disk accesses and extend the lifetime of SSDs. Current SSD cache management research either improves cache hit ratio while ignoring fairness, or improves fairness while sacrificing overall performance. In this paper, we present MLCache, a space-efficient shared cache management scheme for NVMe SSDs. By learning the impact of reuse distance on cache allocation, a workload-generic neural network model is built. At runtime, MLCache continuously monitors the reuse distance distribution for the neural network module to obtain space-efficient allocation decisions. MLCache also proposes an efficient parallel writing back strategy based on hit ratio and response time, to improve fairness. Experimental results show MLCache improves the write hit ratio when compared to baseline, and MLCache strongly safeguards the fairness of SSDs with parallel write-back and maintains a low level of degradation.
- 11 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 34 (1) , 383-399
A Space-Efficient Fair Cache Scheme Based on Machine Learning for NVMe SSDs
Non-volatile memory express (NVMe) solid-state drives (SSDs) have been widely adopted in multi-tenant cloud computing environments or multi-programming systems. The on-board DRAM cache inside NVMe SSDs can efficiently reduce the disk accesses and extend the lifetime of SSDs. Current SSD cache management research either improves cache hit ratio while ignoring fairness, or improves fairness while sacrificing overall performance. In this paper, we present MLCache, a space-efficient shared cache management scheme for NVMe SSDs. By learning the impact of reuse distance on cache allocation, a workload-generic neural network model is built. At runtime, MLCache continuously monitors the reuse distance distribution for the neural network module to obtain space-efficient allocation decisions. MLCache also proposes an efficient parallel writing back strategy based on hit ratio and response time, to improve fairness. Experimental results show MLCache improves the write hit ratio when compared to baseline, and MLCache strongly safeguards the fairness of SSDs with parallel write-back and maintains a low level of degradation.
- 14 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 42 (3) , 768-780
Improving 3-D NAND SSD Read Performance by Parallelizing Read-Retry
With the bit density improvement and the 3D flash techniques, modern NAND flash-memory-based solid-state disks (SSDs) dramatically increase the flash storage capacity. However, in high-density SSDs, the long read latency overheads due to massive read-retry steps, have become a serious performance concern to develop flash memory in storage devices. In this paper, we proposed a parallel read-retry scheme (PaRR) to utilize the read-retry characteristics among flash memory cells. Specifically, when reading the multiple data pages simultaneously, PaRR reduces the read response time by parallelizing read-retry operations. PaRR reduces the number of read-retry operations by parallelizing read-retry steps with the different aggressive read reference voltages if simultaneously reading the data pages that exhibit virtually equivalent reliability characteristic. Our evaluation shows that PaRR improves the I/O performance by 33.77% on average compared with the state-of-the-art scheme.
- 14 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 42 (3) , 768-780
Improving 3-D NAND SSD Read Performance by Parallelizing Read-Retry
With the bit density improvement and the 3D flash techniques, modern NAND flash-memory-based solid-state disks (SSDs) dramatically increase the flash storage capacity. However, in high-density SSDs, the long read latency overheads due to massive read-retry steps, have become a serious performance concern to develop flash memory in storage devices. In this paper, we proposed a parallel read-retry scheme (PaRR) to utilize the read-retry characteristics among flash memory cells. Specifically, when reading the multiple data pages simultaneously, PaRR reduces the read response time by parallelizing read-retry operations. PaRR reduces the number of read-retry operations by parallelizing read-retry steps with the different aggressive read reference voltages if simultaneously reading the data pages that exhibit virtually equivalent reliability characteristic. Our evaluation shows that PaRR improves the I/O performance by 33.77% on average compared with the state-of-the-art scheme.
- Open Access
IMRSim: A Disk Simulator for Interlaced Magnetic Recording Technology
The emerging interlaced magnetic recording (IMR) technology achieves a higher areal density for hard disk drive (HDD) over the conventional magnetic recording (CMR) technology. IMR-based HDD interlaces top tracks and bottom tracks, where each bottom track is overlapped with two neighboring top tracks. Thus, top tracks can be updated without restraint, whereas bottom tracks can be updated by the time-consuming read-modify-write (RMW) or other novel update strategy. Therefore, the layout of the tracks between the IMR-based HDD and the CMR-based HDD is much different. Unfortunately, there has been no related disk simulator and product available to the public, which motivates us to develop an open-source IMR disk simulator to provide a platform for further research. We implement the first public IMR disk simulator, called IMRSim, as a block device driver in the Linux kernel, simulating the interlaced tracks and implementing many state-of-the-art data placement strategies. IMRSim is built on the actual CMR-based HDD to precisely simulate the I/O performance of IMR drives. While I/O operations in CMR-based HDD are easy to visualize, update strategy and multi-stage allocation strategy in IMR are inherently dynamic. Therefore, we further graphically demonstrate how IMRSim processes I/O requests in the visualization mode. We release IMRSim as an open-source IMR disk simulation tool and hope to attract more scholars into related research on IMR technology.
Open AccessIMRSim: A Disk Simulator for Interlaced Magnetic Recording Technology
The emerging interlaced magnetic recording (IMR) technology achieves a higher areal density for hard disk drive (HDD) over the conventional magnetic recording (CMR) technology. IMR-based HDD interlaces top tracks and bottom tracks, where each bottom track is overlapped with two neighboring top tracks. Thus, top tracks can be updated without restraint, whereas bottom tracks can be updated by the time-consuming read-modify-write (RMW) or other novel update strategy. Therefore, the layout of the tracks between the IMR-based HDD and the CMR-based HDD is much different. Unfortunately, there has been no related disk simulator and product available to the public, which motivates us to develop an open-source IMR disk simulator to provide a platform for further research. We implement the first public IMR disk simulator, called IMRSim, as a block device driver in the Linux kernel, simulating the interlaced tracks and implementing many state-of-the-art data placement strategies. IMRSim is built on the actual CMR-based HDD to precisely simulate the I/O performance of IMR drives. While I/O operations in CMR-based HDD are easy to visualize, update strategy and multi-stage allocation strategy in IMR are inherently dynamic. Therefore, we further graphically demonstrate how IMRSim processes I/O requests in the visualization mode. We release IMRSim as an open-source IMR disk simulation tool and hope to attract more scholars into related research on IMR technology.
- 26 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 41 (6) , 1771-1784
ADS: Leveraging Approximate Data for Efficient Data Sanitization in SSDs
NAND flash memory has been widely adopted in emerging storage systems. To ensure data security, the support of data sanitization in NAND flash memory-based storage systems is widely employed. Although some existing studies made efforts in employing encryption-based, erasure-based, and scrubbing-based secure deletion approaches to achieve the security requirement, they suffer from the risk of being deciphered, the severe performance, and the scrubbing disturbance problems. Meanwhile, 3-D NAND flash technology, which stacks flash cells in vertical direction, is gaining traction in the modern systems. This made the problems more severe because of the increased number of scrubbing disturbance directions in 3-D NAND flash memory. To address the above issue, this work proposes an approximate-data-aware data sanitization scheme (ADS) with the assistance of the error-resilient data of modern applications, which guarantees the highest degree of security for security-sensitive data sanitization (i.e., storage systems do not keep any old version of secure data once secure data are updated). ADS classifies request data into approx-secure (AS), precise-secure (PS), approx-unsecure (AU), and precise-unsecure (PU) data by considering two factors, including data error resilience and data privacy. Then, a novel data allocation strategy is proposed to selectively interleave secure data and approximate data within the flash blocks, which creates the scrubbing friendly data patterns to minimize the overhead of secure deletion. Our experimental results show that ADS reduces the average secure deletion latency by 58.93% over the state of the art.
- 26 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 41 (6) , 1771-1784
ADS: Leveraging Approximate Data for Efficient Data Sanitization in SSDs
NAND flash memory has been widely adopted in emerging storage systems. To ensure data security, the support of data sanitization in NAND flash memory-based storage systems is widely employed. Although some existing studies made efforts in employing encryption-based, erasure-based, and scrubbing-based secure deletion approaches to achieve the security requirement, they suffer from the risk of being deciphered, the severe performance, and the scrubbing disturbance problems. Meanwhile, 3-D NAND flash technology, which stacks flash cells in vertical direction, is gaining traction in the modern systems. This made the problems more severe because of the increased number of scrubbing disturbance directions in 3-D NAND flash memory. To address the above issue, this work proposes an approximate-data-aware data sanitization scheme (ADS) with the assistance of the error-resilient data of modern applications, which guarantees the highest degree of security for security-sensitive data sanitization (i.e., storage systems do not keep any old version of secure data once secure data are updated). ADS classifies request data into approx-secure (AS), precise-secure (PS), approx-unsecure (AU), and precise-unsecure (PU) data by considering two factors, including data error resilience and data privacy. Then, a novel data allocation strategy is proposed to selectively interleave secure data and approximate data within the flash blocks, which creates the scrubbing friendly data patterns to minimize the overhead of secure deletion. Our experimental results show that ADS reduces the average secure deletion latency by 58.93% over the state of the art.