Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation
© 2016 ACM. The focus of this paper is to understand storage costs of em- ulating an atomic shared memory over an asynchronous, dis- tributed message passing system. Previous literature has de- veloped several shared memory emulation algorithms based on replication and erasure coding techniques, and...
Main Authors: | Cadambe, Viveck R., Wang, Zhiying, Lynch, Nancy |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM)
2021
|
Online Access: | https://hdl.handle.net/1721.1/137752 |
Similar Items
-
Coded Emulation of Shared Atomic Memory for Message Passing Architectures
by: Cadambe, Viveck R., et al.
Published: (2013) -
Coded Emulation of Shared Atomic Memory for Message Passing Architectures
by: Cadambe, Viveck R., et al.
Published: (2016) -
A Coded Shared Atomic Memory Algorithm for Message Passing Architectures
by: Cadambe, Viveck R., et al.
Published: (2014) -
A Coded Shared Atomic Memory Algorithm for Message Passing Architectures
by: Cadambe, Viveck R., et al.
Published: (2016) -
A coded shared atomic memory algorithm for message passing architectures
by: Musial, Peter, et al.
Published: (2017)