Haodong Lin

Haodong Lin

Auto-generated profile, based on publicly available information

Haodong Lin

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

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
14 December 2022 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
HLHaodong Lin
Haodong Lin
JLJun Li
Jun Li
ZSZhibing Sha
Zhibing Sha
ZCZhigang Cai
Zhigang Cai
YSYuanquan Shi
Yuanquan Shi
JLJianwei Liao
Jianwei Liao
Most flash-based solid-state drives (SSDs) adopt an onboard dynamic random access memory (DRAM) to buffer hot write data. Then, the write or overwrite operations can be absorbed by the DRAM cache, given that there is sufficient locality in the applications’ I/O access pattern, to consequently avoid flushing the write data onto underlying SSD cells. After analyzing typical real-world workloads over SSDs, we observed that the buffered data of small-size requests are more likely to be reaccessed than those of large write requests. To efficiently utilize the limited space of DRAM cache, this article proposes an adaptive request granularity-based cache management scheme for SSDs. First, we introduce a request block corresponding to a write request, as the cache management granularity, and propose a dynamic manner for classifying small and large request blocks. Next, we design three-level linked lists for supporting different routines of upgradation for small and large request blocks, once their data have been hit in the cache. Finally, we present a scheme of evicting the request blocks having the minimum cost in cache replacement, by taking both factors of access hotness and time discounting into account. Experimental results show that our proposal can yield improvements on cache hits and the overall I/O latency by 21.8 % and 14.7 % on average, compared to state-of-the-art cache management schemes inside SSDs.

28 December 2023 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
HLHaodong Lin
Haodong Lin
JLJunhao Luo
Junhao Luo
JLJun Li
Jun Li
ZSZhibing Sha
Zhibing Sha
ZCZhigang Cai
Zhigang Cai
JLJianwei Liao
Jianwei Liao
NAND-based solid state drives (SSDs) are almost ubiquitously used in safety-critical systems, and recent advances have demonstrated redundant array of independent disks (RAID) implementations that built on the top of SSDs can effectively enhance the data integrity and reliability. RAID can restore the lost data chunks in case of failures of RAID components (i.e., SSDs in the context), through a process of RAID reconstruction. Specially, online RAID reconstruction allows the RAID system to continue fulfilling user I/O requests during reconstruction. Servicing user I/O requests, however, significantly affects the performance of reconstruction due to contention for the shared SSD bandwidth. This article proposes a fast online reconstruction method for SSD-based RAID systems, that preferably restores the lost chunks if the replaced SSD device is idle to reduce the reconstruction time, thus minimizing the probability of a second disk failure in the RAID system during reconstruction. Furthermore, it schedules the tasks of restoring data/parity chunks according to the their impacts on other working SSDs in the RAID system, for the purpose of reducing the overall I/O latency. Through a series of experiments based on the selected disk traces of real-world applications, we show that the proposed reconstruction scheme can reduce the reconstruction time by up to 45.6 %, and meanwhile cut down the I/O latency by 9.8 % on average compared to state-of-the-art methods.

1 November 2026 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
HLHaodong Lin
Haodong Lin
SWShengzhe Wang
Shengzhe Wang
ZLZihang Lin
Zihang Lin
SWSuzhen Wu
Suzhen Wu
HJHong Jiang
Hong Jiang
BMBo Mao
Bo Mao