Nannan Zhao

Dr. Nannan Zhao

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
7 October 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
KLKai Lu
Kai Lu
NZNannan Zhao
Nannan Zhao
JWJiguang Wan
Jiguang Wan
CFChanghong Fei
Changhong Fei
WZWei Zhao
Wei Zhao
TDTongliang Deng
Tongliang Deng
LSM-tree based key-value (KV) stores suffer severe read performance loss due to the leveled structure of the LSM-tree. Especially, when modern storage devices with high bandwidth and low latency are used, the read performance of KV store is seriously affected by inefficient file indexing. Besides, due to the deletion pattern of inserting tombstones, the KV stores based on LSM-tree are faced with the problem of read performance fluctuations that are caused by large-scale data deletion (also referred to as the Read-After-Delete problem). In this article, TridentKV is proposed to improve the read performance of KV stores. An adaptive learned index structure is first designed to speed up file indexing. Also, a space-efficient partition strategy is proposed to solve the Read-After-Delete problem. Besides, asynchronous reading design is adopted, and SPDK is supported for high concurrency and low latency. TridentKV is implemented on RocksDB and the evaluation results indicate that compared with RocksDB, the read performance of TridentKV is improved by 7× to 12× without loss of write performance and TridentKV provides stable read performance even if a large number of deletions or migrations occur. Instead of RocksDB, TridentKV is exploited to store metadata in Ceph, which improves the read performance of Ceph by 20% $\sim$ 60%.

8 February 2018 in Nonlinear Dynamics
Verified
Journal Article
Closed access
PDF file
Zhongkui SunZhongkui Sun
Zhongkui Sun
NZNannan Zhao
Nannan Zhao
XYXiaoli Yang
Xiaoli Yang
WXWei Xu
Wei Xu

6 June 2024 in ACM Transactions on Storage
Verified
Journal Article
Open access
NZNannan Zhao
Nannan Zhao
MLMuhui Lin
Muhui Lin
HAHadeel Albahar
Hadeel Albahar
APArnab K. Paul
Arnab K. Paul
ZHZhijie Huang
Zhijie Huang
ABAli R. Butt
Ali R. Butt
The wide adoption of Docker containers for supporting agile and elastic enterprise applications has led to a broad proliferation of container images. The associated storage performance and capacity requirements place a high pressure on the infrastructure of container registries that store and distribute images and container storage systems on the Docker client side that manage image layers and store ephemeral data generated at container runtime. The storage demand is worsened by the large amount of duplicate data in images. Moreover, container storage systems that use Copy-on-Write (CoW) file systems as storage drivers exacerbate the redundancy. Exploiting the high file redundancy in real-world images is a promising approach to drastically reduce the growing storage requirements of container registries and improve the space efficiency of container storage systems. However, existing deduplication techniques significantly degrade the performance of both registries and container storage systems because of data reconstruction overhead as well as the deduplication cost. We propose DupHunter, an end-to-end deduplication scheme that deduplicates layers for both Docker registries and container storage systems while maintaining a high image distribution speed and container I/O performance. DupHunter is divided into three tiers: registry tier, middle tier, and client tier. Specifically, we first build a high-performance deduplication engine at the registry tier that not only natively deduplicates layers for space savings but also reduces layer restore overhead. Then, we use deduplication offloading at the middle tier to eliminate the redundant files from the client tier and avoid bringing deduplication overhead to the clients. To further reduce the data duplicates caused by CoWs and improve the container I/O performance, we utilize a container-aware storage system at the client tier that reserves space for each container and arranges the placement of files and their modifications on the disk to preserve locality. Under real workloads, DupHunter reduces storage space by up to 6.9× and reduces the GET layer latency up to 2.8× compared to the state-of-the-art. Moreover, DupHunter can improve the container I/O performance by up to 93% for reads and 64% for writes.

13 January 2024 in Chaos, Solitons & Fractals
Verified
Journal Article
Closed access
YXYuzhu Xiao
Yuzhu Xiao
HXHaohao Xie
Haohao Xie
NZNannan Zhao
Nannan Zhao

29 April 2023 in Physica A: Statistical Mechanics and its Applications
Verified
Journal Article
Closed access
NZNannan Zhao
Nannan Zhao
XZXuexue Zhang
Xuexue Zhang

1 May 2020 in International Journal of Bifurcation and Chaos
Verified
Journal Article
Closed access
PDF file
NZNannan Zhao
Nannan Zhao
Zhongkui SunZhongkui Sun
Zhongkui Sun