Fast lean erasure-coded atomic memory object
Name
LIPIcs-OPODIS-2019-12.pdf
Description
Published version
Size
1.4 MB
Format
Adobe PDF
Checksum (MD5)
c70600e38b03d1c35f109ac746139745
Author(s)
Konwar, KM
Prakash, N
Médard, M
Lynch, N
Date Issued
2019
Journal
Leibniz International Proceedings in Informatics, LIPIcs
Citation
Konwar, KM, Prakash, N, Médard, M and Lynch, N. 2019. "Fast lean erasure-coded atomic memory object." Leibniz International Proceedings in Informatics, LIPIcs, 153.
Version
Final published version
Abstract
© Kishori M. Konwar, N. Prakash, Muriel Médard, and Nancy Lynch; licensed under Creative Commons License CC-BY 23rd International Conference on Principles of Distributed Systems (OPODIS 2019). In this work, we propose FLECKS, an algorithm which implements atomic memory objects in a multi-writer multi-reader (MWMR) setting in asynchronous networks and server failures. FLECKS substantially reduces storage and communication costs over its replication-based counterparts by employing erasure-codes. FLECKS outperforms the previously proposed algorithms in terms of the metrics that to deliver good performance such as storage cost per object, communication cost a high fault-tolerance of clients and servers, guaranteed liveness of operation, and a given number of communication rounds per operation, etc. We provide proofs for liveness and atomicity properties of FLECKS and derive worst-case latency bounds for the operations. We implemented and deployed FLECKS in cloud-based clusters and demonstrate that FLECKS has substantially lower storage and bandwidth costs, and significantly lower latency of operations than the replication-based mechanisms.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution 4.0 International license
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.4230/LIPIcs.OPODIS.2019.12
