Enabling I/O-Efficient Redundancy Transitioning in Erasure-Coded KV Stores via Elastic Reed-Solomon Codes
Authors:
- 1 September 2020
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 246-255
Abstract
Modern key-value (KV) stores increasingly adopt erasure coding to reliably store data. To adapt to the changing demands on access performance and reliability requirements, KV stores perform redundancy transitioning by tuning the redundancy schemes with different coding parameters. However, redundancy transitioning incurs extensive I/Os, which impair the performance of KV stores. We propose a new family of erasure codes, called Elastic Reed-Solomon (ERS) codes, whose primary goal is to mitigate I/Os in redundancy transitioning. ERS codes eliminate data block relocation, while limiting I/Os for parity block updates via the new co-design of encoding matrix construction and data placement. We realize ERS codes as a KV store atop Memcached, and show via LAN testbed experiments that ERS codes significantly reduce the latency of redundancy transitioning compared to state-of-the-arts.Keywords
This publication has 21 references indexed in Scilit:
- Erasure coding for small objects in in-memory KV storage2017
- Enabling Efficient and Reliable Transition from Replication to Erasure Coding for Clustered File SystemsIEEE Transactions on Parallel and Distributed Systems, 2017
- I/O-Efficient Scaling Schemes for Distributed Storage Systems with CRS CodesIEEE Transactions on Parallel and Distributed Systems, 2015
- Atlas: Baidu's key-value storage system for cloud data2015
- An analysis of Facebook photo caching2013
- SDM: A Stripe-Based Data Migration Scheme to Improve the Scalability of RAID-62012
- Network Coding for Distributed Storage SystemsIEEE Transactions on Information Theory, 2010
- Erasure Coding Vs. Replication: A Quantitative Comparison2002
- The HP AutoRAID hierarchical storage systemACM Transactions on Computer Systems, 1996
- Polynomial Codes Over Certain Finite FieldsJournal of the Society for Industrial and Applied Mathematics, 1960