Jinhua Cui

Prof. Jinhua Cui

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 December 2017 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
JCJinhua Cui
Jinhua Cui
YZYoutao Zhang
Youtao Zhang
LSLiang Shi
Liang Shi
CXChun Jason Xue
Chun Jason Xue
WWWeiguo Wu
Weiguo Wu
JYJun Yang
Jun Yang
Three-dimensional (3D) NAND flash is one of the most prospective advances in flash memory industry. While 3D flash improves cell density and reduces lithography cost through die stacking, it suffers from severe program disturbance, which leads to significant performance and lifetime degradation for 3D flash based SSDs. To address the above challenge, we propose ApproxFTL, an approximate-write aware flash translation layer design, that uses approximate-write operations to store error-resilient data of modern applications. By reducing the maximal threshold voltage and tightening the guard bands between multi-level cell states, approximate write operations not only finish early but also exhibit large disturbance reduction, which can be exploited to alleviate disturbance in physical blocks that save both precise and approximate data. ApproxFTL maximizes the disturbance mitigation through approximate-write aware data placement, wear leveling, and garbage collection enhancements. Our experimental results show that ApproxFTL, while preserving high data quality, improves the read and write response time of flash accesses by 41.38% and 45.64% on average, respectively, and extends the lifetime of 3D flash based SSDs by 5.75% when comparing to the state-of-the-art.

11 November 2022 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
WLWeiguang Liu
Weiguang Liu
JCJinhua Cui
Jinhua Cui
TLTiantian Li
Tiantian Li
JLJunwei Liu
Junwei Liu
Laurence YangLaurence Yang
Laurence Yang
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.

24 October 2017 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
JCJinhua Cui
Jinhua Cui
YZYoutao Zhang
Youtao Zhang
WWWeiguo Wu
Weiguo Wu
JYJun Yang
Jun Yang
YWYinfeng Wang
Yinfeng Wang
JHJianhang Huang
Jianhang Huang
NAND flash has been widely adopted in storage systems due to its better read and write performance and lower power consumption over traditional mechanical hard drives. To meet the increasing performance demand of modern applications, recent studies speed up flash accesses by exploiting access latency variations at the device level. Unfortunately, existing flash access schedulers are still oblivious to such variations, leading to sub-optimal I/O performance improvements. In this paper, we propose DLV, a novel flash access scheduler for exploring scheduling opportunities due to device level access latency variations. DLV improves flash access speeds based on process variations and data retention time difference across flash blocks. More importantly, DLV integrates access speed optimization with access scheduling such that the average access response time can be effectively reduced on flash memory storage systems. Our experimental results show that DLV achieves an average of 41.5% performance improvement over the state-of-the-art.

26 July 2021 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
JCJinhua Cui
Jinhua Cui
WLWeiguang Liu
Weiguang Liu
JHJianhang Huang
Jianhang Huang
Laurence YangLaurence Yang
Laurence Yang
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.

14 July 2022 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
JCJinhua Cui
Jinhua Cui
ZZZhimin Zeng
Zhimin Zeng
JHJianhang Huang
Jianhang Huang
WYWeiqi Yuan
Weiqi Yuan
Laurence YangLaurence Yang
Laurence Yang
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.

2 November 2020
Verified
Conference Paper
Open access
WLWeiguang Liu
Weiguang Liu
JCJinhua Cui
Jinhua Cui
JLJunwei Liu
Junwei Liu
LYLaurence T. Yang
Laurence T. Yang
Non-volatile memory express (NVMe) solid-state drives (SSDs) have been widely adopted in emerging storage systems, which can provide multiple I/O queues and high-speed bus to maximize high data transfer rate. NVMe SSD use streams (also called "Multi-Queue") to store related data in associated locations or for other performance enhancements. The on-board DRAM cache inside NVMe SSDs can efficiently reduce the disk accesses and extend the lifetime of SSDs, thus improving the overall efficiency of the storage systems. However, in previous studies, such SSD cache has been only used as a shared cache for all streams or a statically partitioned cache for each stream, which may seriously degrade the performance-per-stream and underutilize the valuable cache resources. In this paper, we present MLCache, a space-efficient shared cache management scheme for NVMe SSDs, which maximizes the write hit ratios, as well as enhances the SSD lifetime. We formulate cache space allocation as a machine learning problem. By learning the impact of reuse distance on cache allocation, we build a workload specific neural network model. At runtime, MLCache continuously monitors the reuse distance distribution for the neural network module to obtain space-efficient allocation decisions. Experimental results show MLCache improves the write hit ratio of the SSD by 24% compared to baseline, and achieves response time reduction by 13.36% when compared with baseline. MLCache is 96% similar to the ideal model.