Tiger: Disk-Adaptive Redundancy Without Placement Restrictions
Saurabh Kadekodi, Francisco Maturana, Sanjith Athlur, Arif Merchant, K. V. Rashmi, Gregory R. Ganger
摘要
Large-scale cluster storage systems use redundancy (via erasure coding) to ensure data durability. Disk-adaptive redundancy-dynamically tailoring the redundancy scheme to observed disk failure rates-promises significant space and cost savings. Existing disk-adaptive redundancy systems, however, pose undesirable constraints on data placement, partitioning disks into subclusters that have homogeneous failure rates and forcing each erasure-coded stripe to be entirely placed on the disks within one subcluster. This design increases risk, by reducing intra-stripe diversity and being more susceptible to unanticipated changes in a make/model's failure rate, and only works for very large storage clusters fully committed to disk-adaptive redundancy.
Tiger is a new disk-adaptive redundancy system that efficiently avoids adoption-blocking placement constraints, while also providing higher space-savings and lower risk relative to prior designs. To do so, Tiger introduces the eclectic stripe, in which redundancy is tailored to the potentially-diverse failure rates of whichever disks are selected for storing that particular stripe. With eclectic stripes, pre-existing placement policies can be used while still enjoying the space-savings and robustness benefits of disk-adaptive redundancy. This paper introduces eclectic striping and Tiger's design, including a new mean-time-to-data-loss (MTTDL) approximation technique and new approaches for ensuring safe per-stripe settings given that failure rates of different devices change over time. In addition to avoiding placement constraints, evaluation with logs from real-world clusters shows that Tiger provides better space-savings, less bursty IO for changing redundancy schemes, and better robustness (due to increased risk-diversity) than prior disk-adaptive redundancy designs.
- Tiger reuses the Ruptures change-point detection library [47,48], the AFR curve-learner and the rate-limiter from HeART [25] and Pacemaker [24].
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper10
- Practical Design Considerations for Wide Locally Recoverable Codes (LRCs)Saurabh Kadekodi, Shashwat Silas, David Clausen, Arif MerchantFAST 2023 · 被引用 55 次
- Hermit: Low-Latency, High-Throughput, and Transparent Remote Memory via Feedback-Directed AsynchronyYifan Qiao, Chenxi Wang, Zhenyuan Ruan, Adam Belay 等NSDI 2023 · 被引用 50 次
- 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 次
- RL-Watchdog: A Fast and Predictable SSD Liveness Watchdog on Storage SystemsJinyong Ha, Sangjin Lee, Heon Young Yeom, Yongseok SonUSENIX ATC 2024 · 被引用 10 次
它引用的顶会 Paper2
- Facebook's Tectonic Filesystem: Efficiency from ExascaleSatadru Pan, Theano Stavrinos, Yunqiao Zhang, Atul Sikaria 等FAST 2021 · 被引用 110 次
- PACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancySaurabh Kadekodi, Francisco Maturana, Suhas Jayaram Subramanya, Juncheng Yang 等OSDI 2020 · 被引用 29 次
相关 Paper
- Optimal Data Placement for Stripe Merging in Locally Repairable CodesSi Wu, Qingpeng Du, Patrick P. C. Lee, Yongkun Li 等INFOCOM 2022 · 被引用 23 次
- Okapi: Decoupling Data Striping and Redundancy Grouping in Cluster File SystemsSanjith Athlur, Timothy Kim, Saurabh Kadekodi, Francisco Maturana 等OSDI 2025 · 被引用 1 次
- On the Optimal Repair-Scaling Trade-off in Locally Repairable CodesSi Wu, Zhirong Shen, Patrick P. C. LeeINFOCOM 2020 · 被引用 30 次
- RAIDP: replication with intra-disk parityEitan Rosenfeld, Aviad Zuck, Nadav Amit, Michael Factor 等EuroSys 2020 · 被引用 3 次
- Morph: Efficient File-Lifetime Redundancy Management for Cluster File SystemsTimothy Kim, Sanjith Athlur, Saurabh Kadekodi, Francisco Maturana 等SOSP 2024 · 被引用 4 次
