Huanhuan Tian

Huanhuan Tian

Auto-generated profile, based on publicly available information

Huanhuan Tian

College of Computer and Information Science, Southwest University, Chongqing, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
21 June 2024 in ACM Transactions on Design Automation of Electronic Systems
Verified
Journal Article
Open access
HTHuanhuan Tian
Huanhuan Tian
JTJiewen Tang
Jiewen Tang
JLJun Li
Jun Li
ZSZhibing Sha
Zhibing Sha
FYFan Yang
Fan Yang
JLJianwei Liao
Jianwei Liao
Considering 3D NAND flash has a new property of process variation (PV) , which causes different raw bit error rates (RBER) among different layers of the flash block. This article builds a mathematical model for estimating the retention errors of flash cells, by considering the factor of layer-to-layer PV in 3D NAND flash memory, as well as the factors of program/erase (P/E) cycle and retention time of data. Then, it proposes classifying the layers of flash block in 3D NAND flash memory into profitable and unprofitable categories, according to the error correction overhead. After understanding the retention error variation of different layers in 3D NAND flash, we design a mechanism of data placement, which maps the write data onto a suitable layer of flash block, according to the data hotness and the error correction overhead of layers, to boost read performance of 3D NAND flash. The experimental results demonstrate that our proposed retention error estimation model can yield a R 2 value of 0.966 on average, verifying the accuracy of the model. Based on the estimated retention error rates of layers, the proposed data placement mechanism can noticeably reduce the read latency by 29.8 % on average, compared with state-of-the-art methods against retention errors for 3D NAND flash memory.

7 October 2025 in Journal of Systems Architecture
Verified
Journal Article
Closed access
HTHuanhuan Tian
Huanhuan Tian
ZSZhibing Sha
Zhibing Sha
FYFan Yang
Fan Yang
AYAobo Yang
Aobo Yang
LCLi Cai
Li Cai
JLJianwei Liao
Jianwei Liao

1 January 2026 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
HTHuanhuan Tian
Huanhuan Tian
AYAobo Yang
Aobo Yang
LCLi Cai
Li Cai
ZSZhibing Sha
Zhibing Sha
YSYuanquan Shi
Yuanquan Shi
JLJianwei Liao
Jianwei Liao

13 June 2025
Verified
Conference Paper
Open access
AYAobo Yang
Aobo Yang
HTHuanhuan Tian
Huanhuan Tian
YHYuyang He
Yuyang He
JWJiaojiao Wu
Jiaojiao Wu
JWJiaxu Wu
Jiaxu Wu
JLJianwei Liao
Jianwei Liao

22 October 2026 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
LCLi Cai
Li Cai
YHYuyang He
Yuyang He
HTHuanhuan Tian
Huanhuan Tian
ZSZhibing Sha
Zhibing Sha
JWJiaojiao Wu
Jiaojiao Wu
JLJianwei Liao
Jianwei Liao
Superblocks are widely used in SSDs to exploit internal parallelism thus improving I/O throughput. Although dynamic-size superblock schemes enhance space utilization for varied workloads, they introduce internal fragmentation and impact overall performance. To address this issue, we propose Buddy , a novel dynamic-size superblock management scheme based on the buddy system, which adapts to I/O patterns by dynamically splitting and merging superblocks. This approach maintains large blocks to preserve parallelism for sequential writes and generates smaller blocks on demand to handle random writes effectively. We further introduce the expansion GC mechanism to adaptively adjust GC unit size based on I/O intensity and GC efficiency for alleviating fragmentation and preserving SSD parallelism. Trace-driven evaluations with real-world benchmarks demonstrate that our approach can reduce average I/O latency and GC-induced data migration by 47.0 % and 24.5 %, respectively, compared to state-of-the-art superblock management techniques.