Okapi: Decoupling Data Striping and Redundancy Grouping in Cluster File Systems
Sanjith Athlur, Timothy Kim, Saurabh Kadekodi, Francisco Maturana, Xavier Ramos, Arif Merchant, K. V. Rashmi, Gregory R. Ganger
摘要
The Okapi cluster file system decouples how data is spread across disks (data striping) for IO efficiency from how data is erasure coded together (redundancy grouping) for durability. Existing systems couple these two mechanisms' configurations, inducing significant inefficiencies. Decoupling allows grouping to be configured based on reliability and space efficiency goals, while simultaneously allowing striping to be configured based on performance goals. Decoupling also allows redundancy scheme changes from one EC scheme to another (e.g., to react to data temperature or disk failure rate changes) to occur without having to re-write data. Evaluation of an Okapi prototype shows that decoupling can be accomplished with <1% increase in metadata size and file manager memory, and minimal file creation and degraded read resource increase. Experiments demonstrate that decoupling can improve read throughput by 80% and reduce seeks per second by up to 70%, without yielding any data reliability, and reduce the overhead of redundancy transitions by up to 70%.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- WiseCode: Breaking the Scalability Barriers of Wide-Stripe Vector CodesSijie Cai, Guangyan Zhang, Xiao NiuOSDI 2026
- TCO-driven Storage Provisioning for Exascale Data CentersTimothy Kim, Saurabh Kadekodi, Arif Merchant, Prashant Nema 等EuroSys 2026
- Scaling the IO Wall with Declarative IOSanjith Athlur, Sara McAllister, Theo Gregersen, Timothy Kim 等OSDI 2026
它引用的顶会 Paper6
- Facebook's Tectonic Filesystem: Efficiency from ExascaleSatadru Pan, Theano Stavrinos, Yunqiao Zhang, Atul Sikaria 等FAST 2021 · 被引用 110 次
- Exploiting Combined Locality for Wide-Stripe Erasure Coding in Distributed StorageYuchong Hu, Liangfeng Cheng, Qiaori Yao, Patrick P. C. Lee 等FAST 2021 · 被引用 88 次
- Practical Design Considerations for Wide Locally Recoverable Codes (LRCs)Saurabh Kadekodi, Shashwat Silas, David Clausen, Arif MerchantFAST 2023 · 被引用 55 次
- PACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancySaurabh Kadekodi, Francisco Maturana, Suhas Jayaram Subramanya, Juncheng Yang 等OSDI 2020 · 被引用 29 次
- Tiger: Disk-Adaptive Redundancy Without Placement RestrictionsSaurabh Kadekodi, Francisco Maturana, Sanjith Athlur, Arif Merchant 等OSDI 2022 · 被引用 20 次
相关 Paper
- DEPART: Replica Decoupling for Distributed Key-Value StorageQiang Zhang, Yongkun Li, Patrick P. C. Lee, Yinlong Xu 等FAST 2022 · 被引用 12 次
- Optimal Data Placement for Stripe Merging in Locally Repairable CodesSi Wu, Qingpeng Du, Patrick P. C. Lee, Yongkun Li 等INFOCOM 2022 · 被引用 23 次
- Morph: Efficient File-Lifetime Redundancy Management for Cluster File SystemsTimothy Kim, Sanjith Athlur, Saurabh Kadekodi, Francisco Maturana 等SOSP 2024 · 被引用 4 次
- Mitigating Resource Usage Dependency in Sorting-based KV Stores on Hybrid Storage Devices via Operation DecouplingQingyang Zhang, Yongkun Li, Yubiao Pan, Haoting Tang 等USENIX ATC 2025 · 被引用 3 次
- A Logically Disaggregated Cache for Replicated Storage SystemsKiran Hombal, Henry Zhu, Shreesha Gopalakrishna Bhat, Neil Kaushikkar 等EuroSys 2026
