Silvia Bonomi
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.
- Aguilera M. K., Keidar I., Malkhi D., Shraer A., Dynamic atomic storage without consensus, in Proceedings of 28
th
Annual ACM Symposium on Principles of Distributed Computing (PODC) 2009. Google Scholar
Digital Library
- Aguilera M., Chen W., Toueg S. Failure Detection and Consensus in the Crash-recovery Model. Distributed Computing, 13(2), 99--125, 2000. Google ScholarDigital Library
- Aiyer A. S., Alvisi L., Bazzi R. A. Bounded Wait-Free Implementation of Optimally resilient Byzantine Storage without (Unproven) Cryptographic assumptions in Proceedings of 21th International Symposium on Distributed Computing (DISC), 2007. Google ScholarDigital Library
- Amazon's Simple Storage Service. Available at http://aws.amazon.com/s3.Google Scholar
- Baldoni R., Bonomi S., Kermarrec A. M., Raynal M., Implementing a Register in a Dynamic Distributed System, in Proceedings of the 29th IEEE International Conference on Distributed Computing Systems (ICDCS), 2009. Google ScholarDigital Library
- Baldoni R., Bonomi S., Soltani Nezhad A. Regular Registers in Dynamic Distributed Systems with Byzantine Processes: Bounds and Performance Analysis Technical report - MIDLAB 3/11 - 2011. A short version of this paper will appear in PODC 2011.Google Scholar
- Baldoni R., Bonomi S., Soltani Nezhad A. An Algorithm for implementing BFT Registers in Distributed Systems with Bounded Churn In Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2011), 2011. Google ScholarDigital Library
- Bonomi S., Soltani Nezhad A. Multi-writer Regular Registers in Dynamic Distributed Systems with Byzantine Failures Technical report - MIDLAB 7/11 - 2011.Google Scholar
- Chockler G., Gilbert S., Gramoli V., Musial P. M. and Shvartsman A., Reconfigurable distributed storage for dynamic networks Journal Parallel Distributed Computing, 69(1), 100--116, 2009. Google ScholarDigital Library
- Gilbert S., Lynch N., and Shvartsman A., RAMBO II: Rapidly Reconfigurable Atomic Memory for Dynamic Networks, in Proceedings of International Conference on Dependable Systems and Networks (DSN), 2003.Google ScholarCross Ref
- Maurice Herlihy Wait-free synchronization ACM Transaction on Programming Languages and Systems (TOPLAS) 13 (1), pp. 124--149, 1991 Google ScholarDigital Library
- Lamport. L., On Interprocess Communication, Part 1: Models, Part 2: Algorirhms, Distributed Computing, 1(2):77--101, 1986.Google ScholarCross Ref
- Lynch, N. and Shvartsman A., RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks, in Proceedings of the 16th International Symposium on Distributed Computing (DISC), 2002. Google ScholarDigital Library
- Malkhi D., Reiter M. K. Byzantine Quorum Systems, Distributed Computing 11(4), 203--213, 1998. Google ScholarDigital Library
- Martin J., Alvisi L., Dahlin M. Minimal Byzantine Storage, in Proceedings of the 16th International Symposium on Distributed Computing (DISC), 2002. Google ScholarDigital Library
- Merritt M. and Taubenfeld G., Computing with Infinitely Many Processes, in Proceedings of the 14th Int'l Symposium on Distributed Computing (DISC), Google ScholarDigital Library
- Schneider Fred B., Implementing Fault-Tolerant Services Using the State Machine Approach, ACM Computing Surveys, 22(4), 299--319, 1990 Google ScholarDigital Library
- Shao C., Pierce E. and Welch J. L. Multi-writer Conditions for Shared Memory Objects in Proc. 17th Int'l Symposium on Distributed Computing (DISC'03) LNCS #2848, pp. 106--120, 2003.Google Scholar
Index Terms
- Multi-writer regular registers in dynamic distributed systems with byzantine failures
Recommendations
Implementing a Register in a Dynamic Distributed System
ICDCS '09: Proceedings of the 2009 29th IEEE International Conference on Distributed Computing SystemsProviding distributed processes with concurrent objects is a fundamental service that has to be offered by any distributed system. The classical shared read/write register is one of the most basic ones. Several protocols have been proposed that build an ...
Multi-writer composite registers
A composite register is an array-like shared data object that is partitioned into a number of components. An operation of such a register either writes a value to a single component, or reads the values of all components. A composite register reduces to ...
Comments