Jiebin Zhai

dblp:351/6646 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0001-8557-0480ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 87% Cloud and datacenter computing · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › storage reliability
erasure coding
0.812024
Achieving Tunable Erasure Coding with Cluster-Aware Redundancy Transitioning · ACM Trans. Archit. Code Optim. 2024
Storage systems › repair
redundancy transitioning
0.812024
Achieving Tunable Erasure Coding with Cluster-Aware Redundancy Transitioning · ACM Trans. Archit. Code Optim. 2024
Cloud and datacenter computing
datacenter storage
0.212024
Achieving Tunable Erasure Coding with Cluster-Aware Redundancy Transitioning · ACM Trans. Archit. Code Optim. 2024

Methods — techniques the papers use, named apart from their topics

parity-coordinated update · 0.8parity rotation · 0.8maximum flow · 0.8
YearPublicationVenuePosition
2025 DraEC: A Decentralized Routing Algorithm in Erasure-Coded Deduplication System
Ronglong Wu, Jiebin Zhai, Zhirong Shen
APPT2
2024 Achieving Tunable Erasure Coding with Cluster-Aware Redundancy Transitioning
abstract
Erasure coding has been demonstrated as a storage-efficient means against failures, yet its tunability remains a challenging issue in data centers, which is prone to induce substantial cross-cluster traffic. In this article, we presentClusterRT, a cluster-aware redundancy transitioning approach that can dynamically tailor the redundancy degree of erasure coding in data centers.ClusterRTformulates the data relocation as the maximum flow problem to reduce cross-cluster data transfers. It then designs a parity-coordinated update algorithm, which gathers the parity chunks within the same cluster and leverages encoding dependency to further decrease the cross-cluster update traffic.ClusterRTfinally rotates the parity chunks to balance the cross-cluster transitioning traffic across the data center. Large-scale simulation and Alibaba Cloud ECS experiments show thatClusterRTreduces 94.0% to 96.2% of transitioning traffic and reduces 70.4% to 88.4% of transitioning time.
Feng Zhang 0007, Fulin Nan, Zhirong Shen, Jiebin Zhai, Dmitry I. Kaplun, Jiwu Shu
ACM Trans. Archit. Code Optim.5