A Coded Shared Atomic Memory Algorithm for Message Passing Architectures
Name
Lynch_A coded.pdf
Size
250.18 KB
Format
Adobe PDF
Checksum (MD5)
dcb6e19fc67b73c97f8535507804769b
Author(s)
Cadambe, Viveck R.
Medard, Muriel
Musial, Peter
Lynch, Nancy A.
Date Issued
August 2014
Journal
Proceedings of the 2014 IEEE 13th International Symposium on Network Computing and Applications
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Cadambe, Viveck R., Nancy Lynch, Muriel Medard, and Peter Musial. “A Coded Shared Atomic Memory Algorithm for Message Passing Architectures.” 2014 IEEE 13th International Symposium on Network Computing and Applications (August 2014).
Version
Author's final manuscript
Abstract
This paper considers the communication and storage costs of emulating atomic (linearizable) multi-writer multi-reader shared memory in distributed message-passing systems. The paper contains two main contributions: 1) We present an atomic shared-memory emulation algorithm that we call Coded Atomic Storage (CAS). This algorithm uses erasure coding methods. In a storage system with 'N' servers that is resilient to 'f' server failures, we show that the communication cost of CAS is N/(N-2f). The storage cost of CAS is unbounded. 2) We present a variant of CAS known as CAS with Garbage Collection (CASGC). The CASGC algorithm is parametrized by an integer 'd' and has a bounded storage cost. We show that in every execution where the number of write operations that are concurrent with a read operation is no bigger than d, the CASGC algorithm with parameter d satisfies atomicity and liveness. We explicitly characterize the storage cost of CASGC, and show that it has the same communication cost as CAS.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/NCA.2014.44
