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
Abstract
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%.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 2ebb79bf-2645-4ef2-a193-b5c915dff781Cited by top-tier papers3
- 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 et al.EuroSys 2026
- Scaling the IO Wall with Declarative IOSanjith Athlur, Sara McAllister, Theo Gregersen, Timothy Kim et al.OSDI 2026
Builds on6
- Facebook's Tectonic Filesystem: Efficiency from ExascaleSatadru Pan, Theano Stavrinos, Yunqiao Zhang, Atul Sikaria et al.FAST 2021 · 110 citations
- Exploiting Combined Locality for Wide-Stripe Erasure Coding in Distributed StorageYuchong Hu, Liangfeng Cheng, Qiaori Yao, Patrick P. C. Lee et al.FAST 2021 · 88 citations
- Practical Design Considerations for Wide Locally Recoverable Codes (LRCs)Saurabh Kadekodi, Shashwat Silas, David Clausen, Arif MerchantFAST 2023 · 55 citations
- PACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancySaurabh Kadekodi, Francisco Maturana, Suhas Jayaram Subramanya, Juncheng Yang et al.OSDI 2020 · 29 citations
- Tiger: Disk-Adaptive Redundancy Without Placement RestrictionsSaurabh Kadekodi, Francisco Maturana, Sanjith Athlur, Arif Merchant et al.OSDI 2022 · 20 citations
Related papers
- DEPART: Replica Decoupling for Distributed Key-Value StorageQiang Zhang, Yongkun Li, Patrick P. C. Lee, Yinlong Xu et al.FAST 2022 · 12 citations
- Optimal Data Placement for Stripe Merging in Locally Repairable CodesSi Wu, Qingpeng Du, Patrick P. C. Lee, Yongkun Li et al.INFOCOM 2022 · 23 citations
- Morph: Efficient File-Lifetime Redundancy Management for Cluster File SystemsTimothy Kim, Sanjith Athlur, Saurabh Kadekodi, Francisco Maturana et al.SOSP 2024 · 4 citations
- Mitigating Resource Usage Dependency in Sorting-based KV Stores on Hybrid Storage Devices via Operation DecouplingQingyang Zhang, Yongkun Li, Yubiao Pan, Haoting Tang et al.USENIX ATC 2025 · 3 citations
- A Logically Disaggregated Cache for Replicated Storage SystemsKiran Hombal, Henry Zhu, Shreesha Gopalakrishna Bhat, Neil Kaushikkar et al.EuroSys 2026
