Title
Dynamic atomic storage without consensus
Abstract
This article deals with the emulation of atomic read/write (R/W) storage in dynamic asynchronous message passing systems. In static settings, it is well known that atomic R/W storage can be implemented in a fault-tolerant manner even if the system is completely asynchronous, whereas consensus is not solvable. In contrast, all existing emulations of atomic storage in dynamic systems rely on consensus or stronger primitives, leading to a popular belief that dynamic R/W storage is unattainable without consensus. In this article, we specify the problem of dynamic atomic read/write storage in terms of the interface available to the users of such storage. We discover that, perhaps surprisingly, dynamic R/W storage is solvable in a completely asynchronous system: we present DynaStore, an algorithm that solves this problem. Our result implies that atomic R/W storage is in fact easier than consensus, even in dynamic systems.
Year
DOI
Venue
2011
10.1145/1944345.1944348
J. ACM
Keywords
Field
DocType
dynamic systems,dynamic R,dynamic atomic storage,W storage,asynchronous system,atomic R,atomic read,atomic storage,dynamic asynchronous message,dynamic atomic read,article deal,shared-memory emulations,dynamic system
Discrete mathematics,Asynchronous communication,Computer science,Parallel computing,Emulation,Dynamical system,Message passing
Journal
Volume
Issue
ISSN
58
2
0004-5411
Citations 
PageRank 
References 
24
1.00
25
Authors
4
Name
Order
Citations
PageRank
Marcos Kawazoe Aguilera12519153.60
Idit Keidar21892155.01
Dahlia Malkhi32692185.55
Alexander Shraer440822.85