Fault-tolerant semifast implementations of atomic read/write registers

Authors:
Chryssis Georgiou;Nicolas C. Nicolaou;Alexander A. Shvartsman
Affiliations:
Department of Computer Science, University of Cyprus, CY-1678 Nicosia, Cyprus;Department of Computer Science and Engineering, University of Connecticut, Storrs CT 06269, USA;Department of Computer Science and Engineering, University of Connecticut, Storrs CT 06269, USA and Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA 02139, USA
Venue:
Journal of Parallel and Distributed Computing
Year:
2009

Citing 10
Cited 4

Sharing memory robustly in message-passing systems

Journal of the ACM (JACM)
Distributed Algorithms

Distributed Algorithms
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts

FTCS '97 Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS '97)
Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory

ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
How fast can a distributed atomic read be?

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
How fast can a very robust read be?

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
GeoQuorums: implementing atomic memory in mobile ad hoc networks

Distributed Computing - Special issue: DISC 03
Refined quorum systems

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Atomic shared register access by asynchronous hardware

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science

On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory

OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
The complexity of robust atomic storage

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Fast Access to Distributed Atomic Memory

SIAM Journal on Computing
PoWerStore: proofs of writing for efficient and robust storage

Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we study the case of a single writer, multiple readers, and S servers, such that the writer, any subset of the readers, and up to t servers may crash. A recent result of Dutta et al. [P. Dutta, R. Guerraoui, R.R. Levy, A. Chakraborty, How fast can a distributed atomic read be? In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing, 2004, pp. 236-245] shows how to obtain fast implementations in which both reads and writes complete in one communication round-trip, under the constraint that the number of readers is less than St-2, where t