Guerraoui R. and Schiper A. Consensus service: a modular approach for building faulttolerant agreement protocols in distributed systems. In Proc. of the 26th IEEE Int. Symp. on Fault-Tolerant Computing Systems, pp. 168--177, Sendai, Japan, June 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....in [3, 12] designed with the # of # failure assumption, which have message complexity ### #### #. The idea of using a subset of processes to reach agreement on behalf of the whole set of processes is not new. The Consensus Service proposed by Guerraoui and Schiper utilizes this concept [6]. Their failure model, however, assumes # of # failures, and consequently the subset used to reach agreement is not chosen based on information about correlated failures. By characterizing correlated process failures with cores and survivor sets, we improve performance both in terms of message ....

R. Guerraoui and A. Schiper. Consensus Service: A Modular Approach for Building Fault-tolerant Agreement Protocols in Distributed Systems. In 26th International Symposium on Fault-Tolerant Computing (FTCS-26), pages 168-- 177, Sendai, Japan, June 1996.

....quorum system [13] a generalization of majority sets is a collection of sets such that any two sets, called quorums, intersect [12] Quorum systems have been used to implement data replication protocols, e.g. 4,6,14] Consensus algorithms have been used as building blocks in other work, e. g, [15]. Note. This paper is an extended abstract of a full report [20] The full version includes specifications of all components, complete proofs, and additional results. 2 Data Types We assume distinguished elements , which are not in any of the basic types. For any type A, we define types A# ....

R. Guerraoui and A. Schiper, "Consensus Service: A Modular Approach For Building FaultTolerant Agreement Protocols in Distributed Systems", Proc. of the 26th International Symposium on Fault-Tolerant Computing (FTCS-26), pp. 168-177, 1996.

....write quorums such that any read quorum intersects any write quorum, and (sometimes) such that any two write quorums intersect. Quorums have been used to implement data replication protocols [2, 8, 9, 11, 16, 17, 22, 23] Consensus algorithms have been used as building blocks in other work, e. g, [27]. Paper organization. The rest of the paper is organized as follows. Section 2 describes some data types used by our algorithms. Section 3 contains our speci cation for the Rambo recon gurable atomic memory service. Section 4 contains the speci cation for the Recon recon guration service. ....

R. Guerraoui and A. Schiper, \Consensus Service: A Modular Approach For Building FaultTolerant Agreement Protocols in Distributed Systems", Proc. of the 26th International Symposium on Fault-Tolerant Computing (FTCS-26), pp. 168-177, 1996.

....commonly used voting techniques such as Formalized Majority Voter, Generalized Median Voter, etc. in [23] and the adjudicators and adjudication functions [16] which are generalized concepts of voters and voting algorithms. The Consensus Service is a technique for constructing agreement protocols [17]. Our research is not a theoretical attempt to provide a generalized voting service or notation that strives to express all possible voting algorithms. Rather, it is a pragmatic effort to create an embeddable middleware voting component. Certainly we have tried to make VDL be as general as ....

R. Guerraoui and A. Schiper. Consensus service: A modular approach for building fault-tolerant agreement protocols in distributed systems. In Proceedings of the 26th International Symposium on Fault-Tolerant Computing (FTCS-26), pages 168--177, June 1996.

.... processes (thanks to the consensus module) Though we present here a novel protocol (since its primary intended to Mobiles Groups) a similar use of multiple consensus executions for solving agreement problems (such as membership and atomic broadcast) have been previously presented in other works [22,15,20]. Handling Moves A process p i of a group g willing to move to a new location l, must issue the operation move(g,p i ,l) As a result, the mobile group service will first make sure that there are conditions to the required migration. If so, the location information of p i is updated and a new ....

R.Guerraoui and A.Schiper. Consensus service: A modular approach for building fault-tolerant agreement protocols in distributed systems. Proc. of the 26th Int. Symp. on Fault-Tolerant Computing (FTCS-26), pages 168-177, Japan, June, 1996.

....be expressed as a protocol that uses a solution to the consensus problem as an underlying building block [3, 8, 10, 19] Actually, the consensus problem can be seen as the greatest common sub problem of a family of agreement problems. This encourages the following system architecture advocated in [11]: first design a layer providing an efficient consensus protocol, and, on top of it, design protocols solving particular agreement problems. The consensus problem can be informally stated as follows. Each process proposes a value and has to decide a value (termination property) such that (1) ....

Guerraoui R. and Schiper A., Consensus Service: a Modular Approach for Building Fault-Tolerant Agreement Protocols in Distributed Systems. Proc. 26t IEEE Int. Symposium on Fault-Tolerant Computing (FTCS-26), pp. 168-177, June 1996.

....there is neither shared memory nor global clock, communication and synchronization between processes on different sites are done by message passing, through a network. Providing fault tolerance in asynchronous distributed systems is closely related to solving agreement problems. It was shown in [6] how all the agreement problems are related to the consensus problem, and how the agreement protocols can be built using a generic consensus service. The consensus algorithm allows processes to reach a common decision that depends on their initial inputs, even in the presence of failures. In ....

R. Guerraoui and A. Schiper. Consensus Service: A Modular Approach For Building Fault-Tolerant Agreement Protocols in Distributed Systems. In Proceedings of the 26th IEEE International Symposium on Fault-Tolerant Computing Systems (FTCS26) , 1996.

....of failure detectors on the termination time of a consensus algorithm. Finally, Section 6 discusses related works, and Section 7 concludes the paper. 2. Background 2.1. Consensus Consensus is a central problem in the context of distributed systems, being at the heart of many agreement problems [2, 10, 9]. The problem is defined on a set # of processes: every process # # # # starts with an initial value # # , and all correct processes must agree on a common value # that is the initial value of one of the processes. 2.2. Failure detector model The failure detector model considers a module ## ....

R. Guerraoui and A. Schiper. Consensus service: a modular approach for building fault-tolerant agreement protocols in distributed systems. In Proc. of the 26th IEEE Int'l Symp. on Fault-Tolerant Computing (FTCS-26), pp.168--177, June 1996.

....consensus in the presence of failures. This result also applies to problems that can be solved by a transformation to a consensus problem, e.g. atomic broadcast [2] 2. 2 Consensus Consensus is a central problem in the context of distributed systems, being at the heart of many agreement problems [2, 8, 7]. The problem is defined on a set # of processes: every process p i # # starts with an initial value v i , and all correct processes must agree on a common value v that is the initial value of one of the processes. In this paper, we consider the consensus algorithm using the failure detector #S ....

R. Guerraoui and A. Schiper. Consensus service: A modular approach for building fault-tolerant agreement protocols in distributed systems. In Proceedings of the 26th International Symposium on Fault-Tolerant Computing (FTCS-26), pages 168--177, Sendai, Japan, June 1996.

No context found.

Guerraoui R. and Schiper A. Consensus service: a modular approach for building faulttolerant agreement protocols in distributed systems. In Proc. of the 26th IEEE Int. Symp. on Fault-Tolerant Computing Systems, pp. 168--177, Sendai, Japan, June 1996.

No context found.

R. Guerraoui and A. Schiper, \Consensus Service: A Modular Approach for Building Faulttolerant Agreement Protocols in Distributed Systems," in 26th International Symposium on Fault-Tolerant Computing (FTCS-26), (Sendai, Japan), pp. 168-177, June 1996.

No context found.

R. Guerraoui and A. Schiper, \Consensus Service: A Modular Approach for Building Fault-tolerant Agreement Protocols in Distributed Systems," in 26th International Symposium on Fault-Tolerant Computing (FTCS-26), (Sendai, Japan), pp. 168-177, June 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC