The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

K. Taranov, G. Alonso, T. Hoefler:
	Fast and strongly-consistent per-item resilience in key-value stores (ISBN: 978-1-4503-5584-1/18/04, Apr. 2018, EuroSys '18: Thirteenth EuroSys Conference 2018, April 23--26, 2018, Porto, Portugal ) Abstract In-memory key-value stores (KVSs) provide different forms of resilience through basic rrr-way replication and complex erasure codes such as Reed-Solomon. Each storage scheme exhibits different trade-offs in terms of reliability and resources used (memory, network load, latency, storage required, etc.). Unfortunately, most KVSs support only a single such storage scheme, forcing designers to employ different KVSs for different applications. To address this problem, we have designed a strongly consistent in-memory KVS, Ring, that empowers its users to set the level of resilience on a KV pair basis while still maintaining overall consistency and without compromising efficiency. At the heart of Ring lies a novel encoding scheme, Stretched Reed-Solomon coding, that combines hash key distributions of heterogeneous replication and erasure coding schemes. Ring utilizes RDMA to ensure low latencies and offload communication tasks. Its latency, bandwidth, and throughput are comparable to state-of-the-art systems that do not support changing resilience and, thus, have much higher memory overheads. We show use cases that demonstrate significant memory savings and discuss trade-offs between reliability, performance, and cost. Our work demonstrates how future applications that consciously manage resilience of KV pairs can reduce the overall operational cost and significantly improve the performance of KVS deployments. ACM Stats http://doi.acm.org/10.1145/3190508.3190536 Documents download article: Recorded talk (best effort)
	BibTeX
@inproceedings{,   author={K. Taranov and G. Alonso and T. Hoefler},   title={{Fast and strongly-consistent per-item resilience in key-value stores}},   year={2018},   month={Apr.},   isbn={978-1-4503-5584-1/18/04},   note={EuroSys '18: Thirteenth EuroSys Conference 2018, April 23--26, 2018, Porto, Portugal},   source={http://www.unixer.de/~htor/publications/}, }