Revisiting Data Updates in Erasure-Coded Storage Clusters
ACM Transactions on Storage · 08.08.2026
DOI: 10.1145/3820773 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Storage, online erschienen am 08.08.2026. Verfasst von Hai Zhou und 1 weiteren Autor:innen. Die Arbeit nennt 77 Literaturangaben.
Abstract (Originalsprache)
Erasure coding is widely adopted to maintain data reliability, yet it introduces a significant update penalty. We analyze real-world traces and observe several challenges that are not addressed by existing studies, which thereby restricts the performance gains. We propose FastUpdate , an efficient multi-stripe updates framework that assists existing update schemes for fast updates. FastUpdate comprises three key designs: (i) it perceives the update locality and carefully merges multiple update requests accessing the same stripe to reduce the incurred network traffic; (ii) it abstracts the existing update schemes into collector selection and tree construction, greedily generates the update solution for each stripe to balance the transmission load across nodes; (iii) it dynamically schedules appropriate stripes to update in heterogeneous and dynamic networks to fully utilize the bandwidth resources. Comprehensive evaluations verify the effectiveness of FastUpdate on Alibaba ECS. It can increase the update throughput by 16.15%-88.71% for various update schemes.
Zitieren
APA
Zhou, H., & Feng, D. (2026). Revisiting Data Updates in Erasure-Coded Storage Clusters. ACM Transactions on Storage. https://doi.org/10.1145/3820773
Vancouver
Zhou H, Feng D. Revisiting Data Updates in Erasure-Coded Storage Clusters. ACM Transactions on Storage. 2026. doi:10.1145/3820773
BibTeX
@article{Zhou2026,
author = {Zhou, Hai and Feng, Dan},
title = {Revisiting Data Updates in Erasure-Coded Storage Clusters},
journal = {ACM Transactions on Storage},
year = {2026},
doi = {10.1145/3820773}
}
EUVIMED