PACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancy
Saurabh Kadekodi, Francisco Maturana, Suhas Jayaram Subramanya, Juncheng Yang, K. V. Rashmi, Gregory R. Ganger
摘要
Data redundancy provides resilience in large-scale storage clusters, but imposes significant cost overhead. Substantial space-savings can be realized by tuning redundancy schemes to observed disk failure rates. However, prior design proposals for such tuning are unusable in real-world clusters, because the IO load of transitions between schemes overwhelms the storage infrastructure (termed transition overload). This paper analyzes traces for millions of disks from production systems at Google, NetApp, and Backblaze to expose and understand transition overload as a roadblock to diskadaptive redundancy: transition IO under existing approaches can consume 100% cluster IO continuously for several weeks. Building on the insights drawn, we present PACEMAKER, a low-overhead disk-adaptive redundancy orchestrator. PACE-MAKER mitigates transition overload by (1) proactively organizing data layouts to make future transitions efficient, and (2) initiating transitions proactively in a manner that avoids urgency while not compromising on space-savings. Evaluation of PACEMAKER with traces from four large (110K-450K disks) production clusters show that the transition IO requirement decreases to never needing more than 5% cluster IO bandwidth (0.2-0.4% on average). PACEMAKER achieves this while providing overall space-savings of 14-20% and never leaving data under-protected. We also describe and experiment with an integration of PACEMAKER into HDFS. 1 AFR describes the expected fraction of disks that experience failure in a typical year.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper12
- Practical Design Considerations for Wide Locally Recoverable Codes (LRCs)Saurabh Kadekodi, Shashwat Silas, David Clausen, Arif MerchantFAST 2023 · 被引用 55 次
- Optimal Data Placement for Stripe Merging in Locally Repairable CodesSi Wu, Qingpeng Du, Patrick P. C. Lee, Yongkun Li 等INFOCOM 2022 · 被引用 23 次
- Tiger: Disk-Adaptive Redundancy Without Placement RestrictionsSaurabh Kadekodi, Francisco Maturana, Sanjith Athlur, Arif Merchant 等OSDI 2022 · 被引用 20 次
- Disaggregated RAID Storage in Modern DatacentersJunyi Shu, Ruidong Zhu, Yun Ma, Gang Huang 等ASPLOS 2023 · 被引用 18 次
- ELECT: Enabling Erasure Coding Tiering for LSM-tree-based StorageYanjing Ren, Yuanming Ren, Xiaolu Li, Yuchong Hu 等FAST 2024 · 被引用 18 次
相关 Paper
- Morph: Efficient File-Lifetime Redundancy Management for Cluster File SystemsTimothy Kim, Sanjith Athlur, Saurabh Kadekodi, Francisco Maturana 等SOSP 2024 · 被引用 4 次
- Thesios: Synthesizing Accurate Counterfactual I/O Traces from I/O SamplesPhitchaya Mangpo Phothilimthana, Saurabh Kadekodi, Soroush Ghodrati, Selene Moon 等ASPLOS 2024 · 被引用 6 次
- PASS: A Power Adaptive Storage ServerDedong Xie, Theano Stavrinos, Jonggyu Park, Simon Peter 等EuroSys 2026
- BCW: Buffer-Controlled Writes to HDDs for SSD-HDD Hybrid Storage ServerShucheng Wang, Ziyi Lu, Qiang Cao, Hong Jiang 等FAST 2020 · 被引用 37 次
- Take it to the limit: peak prediction-driven resource overcommitment in datacentersNoman Bashir, Nan Deng, Krzysztof Rzadca, David Irwin 等EuroSys 2021 · 被引用 60 次
