Erasure Coding for Small Objects in In-Memory KV Storage
Refereed conference paper presented and published in conference proceedings

Altmetrics Information
.

Other information
AbstractWe present MemEC, an erasure-coding-based in-memory key-value (KV) store that achieves high availability and fast
recovery while keeping low data redundancy across storage servers. MemEC is specifically designed for workloads dominated by small objects. By encoding objects in entirety, MemEC is shown to incur 60% less storage redundancy for small objects than existing replication- and erasure-coding-based approaches. It also supports graceful transitions between decentralized requests in normal mode (i.e., no failures) and coordinated requests in degraded mode (i.e., with
failures). We evaluate our MemEC prototype via testbed experiments under read-heavy and update-heavy YCSB workloads. We show that MemEC achieves high throughput and low latency in both normal and degraded modes, and supports fast transitions between the two modes.
Acceptance Date29/03/2017
All Author(s) ListMatt M. T. Yiu, Helen H. W. Chan, Patrick P. C. Lee
Name of ConferenceProceedings of the 10th ACM International Systems and Storage Conference (SYSTOR 2017)
Start Date of Conference22/05/2017
End Date of Conference24/05/2017
Place of ConferenceHaifa
Country/Region of ConferenceIsrael
Proceedings TitleProceedings of the 10th ACM International Systems and Storage Conference (SYSTOR 2017)
Year2017
Month5
Pages14:1 - 14:12
LanguagesEnglish-United States
KeywordsErasure coding, In-memory storage

Last updated on 2020-19-05 at 02:12