Multi-writer regular registers in dynamic distributed systems with byzantine failures

Authors:
Silvia Bonomi;Amir Soltani Nezhad
Affiliations:
Sapienza Università di Roma, Via Ariosto, Roma, Italy;Sapienza Università di Roma, Via Ariosto, Roma, Italy
Venue:
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Year:
2011

Citing 12
Cited 0

Implementing fault-tolerant services using the state machine approach: a tutorial

ACM Computing Surveys (CSUR)
Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing with Infinitely Many Processes

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Minimal Byzantine Storage

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Failure detection and consensus in the crash-recovery model

Distributed Computing
Byzantine quorum systems

Distributed Computing
Reconfigurable distributed storage for dynamic networks

Journal of Parallel and Distributed Computing
Dynamic atomic storage without consensus

Proceedings of the 28th ACM symposium on Principles of distributed computing
Implementing a Register in a Dynamic Distributed System

ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
An algorithm for implementing BFT registers in distributed systems with bounded churn

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions

DISC'07 Proceedings of the 21st international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we address the problem of building of a multi-writer/multi-reader regular register storage resilient to byzantine failures in a distributed system affected from churn. A protocol implementing such a register in a synchronous system is proposed and some feasibility constraints on the arrival and departure of processes are given. The protocol is proved to be correct under the assumption that the constraint on the churn is satisfied, and we show that the implementation satisfies the wait-freedom property as soon as the number of writers is bounded and known.