Zhike Li

Mr. Zhike Li


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
5 October 2022 in Cluster Computing
Verified
Journal Article
Open access
PDF file
ZLZhike Li
Zhike Li
Yong WangYong Wang
Yong Wang
The advent of the Big Data era has brought considerable challenges to storing and managing massive data. Moreover, distributed storage systems are critical to the pressure and storage capacity costs. The Ceph cloud storage system only selects data storage nodes based on node storage capacity. This node selection method results in load imbalance and limited storage scenarios in heterogeneous storage systems. Therefore, we add node heterogeneity, network state, and node load as performance weights to the CRUSH algorithm and optimize the performance of the Ceph system by improving load balancing. We designed a cloud storage system model based on Software Defined Network (SDN) technology. This system model can avoid the tedious configuration and significant measurement overhead required to obtain network status in traditional network architecture. Then we propose adaptive read and write optimization algorithms based on SDN technology. The Object Storage Device (OSD) is initially classified based on the Node Heterogeneous Resource Classification Strategy. Then the SDN technology is used to obtain network and load conditions in real-time and an OSD performance prediction model is built to obtain weights for performance impact factors. Finally, a mathematical model is proposed for multi-attribute decision making in conjunction with the OSD state and its prediction model. Furthermore, this model is addressed to optimize read and write performance adaptively. Compared with the original Ceph system, TOPSIS_PA improves the performance of reading operations by 36%; TOPSIS_CW and TOPSIS_PACW algorithms improve the elastic read performance by 23 to 60% and 36 to 85%, and the elastic write performance by 180 to 468% and 188 to 611%, respectively.

4 September 2024 in Future Generation Computer Systems
Verified
Journal Article
Closed access
ZLZhike Li
Zhike Li
YWYong Wang
Yong Wang
SNShiqiang Nie
Shiqiang Nie
JWJinyu Wang
Jinyu Wang
CZChi Zhang
Chi Zhang
WWWeiguo Wu
Weiguo Wu

9 May 2025 in IEEE Transactions on Reliability
Verified
Journal Article
Closed access
SNShiqiang Nie
Shiqiang Nie
ZLZhike Li
Zhike Li
FYFangxing Yu
Fangxing Yu
SLSong Liu
Song Liu
WWWeiguo Wu
Weiguo Wu
While low-density parity-check code has been adopted in 3-D flash for improving chip reliability, it suffers from severe read latency due to the increasing number of read retries. Recent studies propose read-level recording to mitigate the performance loss from failed read retries. However, existing schemes induce large updating overhead and achieve suboptimal results, making it critical to develop better tradeoffs among storage overhead, process variation, and performance improvement. In this article, we propose AR$^{2}$, an adaptive read-level recording scheme to improve read performance for 3-D NOT AND (NAND) flash. It consists of two designs: AR$^{2}$-win and AR$^{2}$-pre. AR$^{2}$-win records the number of read levels that fit the majority of the last $N$ reads, which prevents the worst page from dominating the read level recording. AR$^{2}$-pre predicts the number of read levels for the next read based on the recorded one and a simple machine learning model, which prevents using stale recorded levels in large-capacity solid-state drives (SSDs). Our experimental results show that AR$^{2}$ significantly improves the read performance for 3-D NAND flash and achieves on average 15% or more read latency reduction over the state-of-the-art.

10 December 2025 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
FYFangxing Yu
Fangxing Yu
CZChi Zhang
Chi Zhang
SNShiqiang Nie
Shiqiang Nie
ZLZhike Li
Zhike Li
WWWeiguo Wu
Weiguo Wu
Recently, the emerging Interlaced Magnetic Recording (IMR) technology has substantially improved the areal density of disks by implementing interlaced track layout. While this track layout enhances disk storage capacity, it impairs the flexibility of write positioning. To maintain stable write performance of IMR disks, operations such as Read-Modify-Write (RMW) or Garbage Collection (GC) must be introduced, which inevitably incur extra I/Os. Especially in write-intensive workloads, the excessive additional I/Os exacerbate the write amplification effect, thereby severely degrading the overall performance of IMR disks. Although existing data management strategies strive to reduce extra I/Os via device drivers or system middleware, the semantic disparity between the disk and file system inherently limits these strategies to achieve optimal performance. To address the aforementioned challenge,this paper proposes IMR-Friendly File System (IFFS), an innovative file system tailored for IMR disks. First, we propose a semantic-aware hotness identification algorithm based on Online K-means, which redefines the data hotness metric by exploiting file system semantics to reduce data migration induced by inaccurate data classification. Second, we introduce an I/O-overhead-minimized data placement strategy that adaptively selects between in-place and out-of-place writing modes based on data hotness metrics. Furthermore, this strategy employs a log-transition mechanism to dynamically adjust write positions, effectively mitigating I/O overhead caused by RMWs and scattered read requests. Finally, we implement a multi-factor garbage collection mechanism that incorporates intra-zone data hotness, data layout, fragmentation levels, and other contextual attributes to optimize file system data management efficiency, thereby enhances the read performance on IMR disk-based storage system performance. Experimental results show that IFFS achieves an average bandwidth improvement of 12.96× over EXT4, XFS, F2FS, and the state-of-the-art work in Fio evaluation. Under YCSB workloads, IFFS improves bandwidth by an average of 56.89% while reducing latency by 34.46%.

27 October 2026 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
FYFangxing Yu
Fangxing Yu
ZLZhike Li
Zhike Li
CZChi Zhang
Chi Zhang
SNShiqiang Nie
Shiqiang Nie
WWWeiguo Wu
Weiguo Wu
Shingled Magnetic Recording (SMR) and Interlaced Magnetic Recording (IMR) technologies significantly increase disk storage density by overlapping internal tracks, but the resulting frequent read-modify-write(RMW) operations can cause severe performance jitter. Building Log-Structured Merge Tree (LSM-tree) based key-value stores on Host-Managed SMR (HM-SMR) and Host-Managed IMR (HM-IMR) enables tight integration between the sequential-write constraints of zoned storage devices and the software log-structured architecture. By redirecting data updates to new physical locations in an append-only manner, rather than overwriting old data in place on overlapped tracks, this design avoids RMW operations caused by track rewrites, thereby improving performance predictability and overall stability. However, existing key-value stores are not systematically designed for heterogeneous storage systems in which HM-SMR and HM-IMR coexist, which leads to evident deficiencies in data layout, compaction strategies, and garbage collection (GC) mechanisms. To address these challenges, we propose OTDB, a key-value store tailored for overlapping track-based Disks. First, we develop a Heterogeneous Multi-Granular Zoned Storage scheme that separates Sorted String Tables (SSTables) from different LSM-tree levels and maps them to zones with differentiated characteristics. By flexibly configuring zone sizes, this scheme reduces zone reset costs and decreases the amount of data migrated during GC. Second, we design a Cross-Level Forecasting Window Compaction strategy that proactively constructs compaction windows and performs SSTable reorganization, thereby reducing redundant compaction operations and effectively mitigating compaction-induced write amplification. Finally, we introduce a Cox-Guided Zoned GC mechanism that leverages survival analysis to accurately predict the remaining lifetime of SSTables and guides their intelligent placement and migration, substantially improving the efficiency and stability of GC. Experimental results show that, compared with the state-of-the-art approaches, OTDB achieves performance improvements of 96.47%–25.67× in microbenchmarks and increases throughput by an average of 1.87× under YCSB workloads.