Yifeng Zhu

Yifeng Zhu


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
1 January 2008
Verified
Conference Paper
Closed access
ASAli Shareef
Ali Shareef
YZYifeng Zhu
Yifeng Zhu
MMMohamad Musavi
Mohamad Musavi

11 January 2023 in ACM Transactions on Storage
Verified
Journal Article
Open access
LLLifang Lin
Lifang Lin
YDYuhui Deng
Yuhui Deng
YZYi Zhou
Yi Zhou
YZYifeng Zhu
Yifeng Zhu
Inline deduplication removes redundant data in real-time as data is being sent to the storage system. However, it causes data fragmentation: logically consecutive chunks are physically scattered across various containers after data deduplication. Many rewrite algorithms aim to alleviate the performance degradation due to fragmentation by rewriting fragmented duplicate chunks as unique chunks into new containers. Unfortunately, these algorithms determine whether a chunk is fragmented based on a simple pre-set fixed value, ignoring the variance of data characteristics between data segments. Accordingly, when backups are restored, they often fail to select an appropriate set of old containers for rewrite, generating a substantial number of invalid chunks in retrieved containers. To address this issue, we propose an inline deduplication approach for storage systems, called InDe , which uses a greedy algorithm to detect valid container utilization and dynamically adjusts the number of old container references in each segment. InDe fully leverages the distribution of duplicated chunks to improve the restore performance while maintaining high backup performance. We define an effectiveness metric, valid container referenced counts (VCRC) , to identify appropriate containers for the rewrite. We design a rewrite algorithm F-greedy that detects valid container utilization to rewrite low-VCRC containers. According to the VCRC distribution of containers, F-greedy dynamically adjusts the number of old container references to only share duplicate chunks with high-utilization containers for each segment, thereby improving the restore speed. To take full advantage of the above features, we further propose another rewrite algorithm called F-greedy+ based on adaptive interval detection of valid container utilization. F-greedy+ makes a more accurate estimation of the valid utilization of old containers by detecting trends of VCRC’s change in two directions and selecting referenced containers in the global scope. We quantitatively evaluate InDe using three real-world backup workloads. The experimental results show that compared with two state-of-the-art algorithms (Capping and SMR), our scheme improves the restore speed by 1.3×–2.4× while achieving almost the same backup performance.

31 March 2023 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
QZQiang Zou
Qiang Zou
YZYifeng Zhu
Yifeng Zhu
JCJianxi Chen
Jianxi Chen
YDYuhui Deng
Yuhui Deng
Xiao QinXiao Qin
Xiao Qin
As cloud platforms become increasingly popular, accurately understanding I/O behaviors in modern cloud storage is of paramount importance for system design and optimization. This paper sheds new light on the correlation of inter-arrival times of both read and write requests at the block level in four representative cloud storage workloads - AliCloud, Systor'17, MSRC and FIU. Our study reveals that I/O arrivals at the block level are very complex in modern cloud storage. There is a certain degree of correlation in the long-term timescale for request arrival intervals in AliCloud and Systor'17_read. Request arrival intervals in MSRC, FIU and Systor'17_write, however, are almost uncorrelated. The Gaussianity test confirms that I/O burstiness appears to be Gaussian in AliCloud_write and Systor'17_read, but the burstiness is non-Gaussian in other workloads. Importantly, we unfold the existence of self-similarity in cloud storage workloads with a certain degree of correlations, via visual evidence, the autocorrelation structure of the aggregated process of I/O request sequences, and Hurst parameter estimates. We further design an alpha-stable workload model for synthetic I/O generation, and the experimental results demonstrate that our model has an edge over conventional models in terms of accurately emulating I/O burstiness.

14 November 2012 in Journal of Computer Networks and Communications
Verified
Journal Article
Open access
PDF file
ASAli Shareef
Ali Shareef
YZYifeng Zhu
Yifeng Zhu
Energy consumption of energy-constrained nodes in wireless sensor networks (WSNs) is a fatal weakness of these networks. Since these nodes usually operate on batteries, the maximum utility of the network is dependent upon the optimal energy usage of these nodes. However, new emerging optimal energy consumption algorithms, protocols, and system designs require an evaluation platform. This necessitates modeling techniques that can quickly and accurately evaluate their behavior and identify strengths and weakness. We propose Petri nets as this ideal platform. We demonstrate Petri net models of wireless sensor nodes that incorporate the complex interactions between the processing and communication components of an WSN. These models include the use of both an open and closed workload generators. Experimental results and analysis show that the use of Petri nets is more accurate than the use of Markov models and programmed simulations. Furthermore, Petri net models are extremely easier to construct and test than either. This paper demonstrates that Petri net models provide an effective platform for studying emerging energy-saving strategies in WSNs.

1 September 2008
Verified
Conference Paper
Closed access
QZQiang Zou
Qiang Zou
DFDan Feng
Dan Feng
YZYifeng Zhu
Yifeng Zhu
HJHong Jiang
Hong Jiang
Xiaohu GeXiaohu Ge
Xiaohu Ge
ZZZhihua Zhou
Zhihua Zhou
Obtaining representative and concise I/O workloads for the purpose of projecting the performance of storage systems remains a challenge due to the complex nature of I/O behaviors. Previous studies have shown that disk I/O traffic can be represented as an independent and identically distributed random process in some workloads and a self-similar process in others. Additionally, workloads in the presence of self-similarity can exhibit either Gaussian or non-Gaussian characteristics. This paper proposes a new and generic model based on the alpha-stable process to accurately build a synthetic workload representative of I/O traffic in production storage systems. The novelty of this new model is that it has the capability of characterizing both self-similar Gaussian and non-Gaussian workloads. Experimental results show that this model can accurately capture the complex I/O behaviors of real storage systems and more faithful than conventional models, particularly the burstiness and heavy-tail characteristics under the Gaussian and non-Gaussian workloads.

1 October 2006 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
YZYifeng Zhu
Yifeng Zhu
HJHong Jiang
Hong Jiang
XQXiao Qin
Xiao Qin
DFDan Feng
Dan Feng
DSDavid R. Swanson
David R. Swanson