Dynamic atomic storage without consensus

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...

Full description

Saved in:
Bibliographic Details
Published in:Journal of the ACM 2011-04, Vol.58 (2), p.5
Main Authors: Aguilera, Marcos K, Keidar, Idit, Malkhi, Dahlia, Shraer, Alexander
Format: Article
Language:English
Subjects:
Algorithms
Complex systems
Information storage
Studies
User interface
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. [PUBLICATION ABSTRACT]
ISSN:0004-5411
1557-735X