L. E. Moser, P. M. Melliar-Smith, and V. Agrawala. Necessary and sufficient conditions for broadcast consensus protocols. Journal of Distributed Computing, 7(2), December 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
New Rules for Early Delivery in an Atomic Multicast System - Johnson, Maugis (1994) (Correct)
....communication medium. Indeed, simulating reliable point to point links over an unreliable broadcast domain significantly wastes network bandwidth[Bra92] From a theoretical standpoint, the requirements for distributed agreement in a broadcast domain are given by Melliar Smith, Moser and Agrawal [MMSA93] They proved that a necessary and sufficient condition for the existence of a deterministic consensus protocol is delivery of each broadcast message to at least d(n k 1) 2e process in an n process system subject to k crash failures. In their broadcast model, if a message is delivered, it is ....
L. E. Moser, P. M. Melliar-Smith, and V. Agrawala. Necessary and sufficient conditions for broadcast consensus protocols. Journal of Distributed Computing, 7(2), December 1993.
Totem: A Reliable Ordered Delivery Protocol for Interconnected.. - Agarwal (1994) (19 citations) (Correct)
.... unfortunately, the impossibility of reaching consensus in an asynchronous distributed system has been shown in [28] Additional proofs are given in [27, 39] and results indicating what is achievable appear in [9] Necessary and sufficient conditions for broadcast consensus protocols are given in [46]. 2.1. TCP 11 Some protocols for reaching consensus in asynchronous systems are asymptotic in the sense that the probability of reaching consensus asymptotically approaches one as time increases. An example of an asymptotic atomic broadcast protocol can be found in [38] Much of the difficulty ....
L. E. Moser, P. M. Melliar-Smith, and V. Agrawala. Necessary and sufficient conditions for broadcast consensus protocols. Distributed Computing, 7(2):75--85, December 1993.
Highly Available Replicated Atomic Data - Maugis (1994) (Correct)
....of broadcast messages. However, as with all token schemes, the algorithm is not fully distributed and the system has to reconfigure when the token is lost. From a theoretical standpoint, the requirements for distributed agreement in a broadcast domain are given by Moser, Melliar Smith and Agrawala [68]. They proved that a necessary and sufficient condition for the existence of a deterministic consensus protocol is delivery of each broadcast message to at least d(n k 1) 2e process in an n process system subject to k crash failures. In their broadcast model, if a message is delivered, it is ....
....of us: 1. We believe that our protocols are very close to the maximum level of concurrency achievable. However with clever optimizations, it might be possible to develop algorithms that provide a higher level of concurrency. Although some theoretical work exist on broadcast consensus protocols [68, 72], we do not have a characterization of an optimal algorithm. 2. The above remark is especially true for the semantic ordering protocol: sites can relax a total order if their sequence of operations invocations is equivalent to the one defined by the total order. However, agreeing on an equivalent ....
L. E. Moser, P. M. Melliar-Smith, and V. Agrawala. Necessary and sufficient conditions for broadcast consensus protocols. Journal of Distributed Computing, 7(2), December 1993.
Two Approaches for High Concurrency in Multicast-Based Object .. - Johnson, Maugis (1994) (3 citations) (Correct)
....of broadcast messages. However, as with all token schemes, the algorithm is not fully distributed and the system has to reconfigure when the token is lost. From a theoretical standpoint, the requirements for distributed agreement in a broadcast domain are given by Moser, Melliar Smith and Agrawala [69]. They proved that a necessary and sufficient condition for the existence of a deterministic consensus protocol is delivery of each broadcast message to at least d(n k 1) 2e process in an n process system subject to k crash failures. In their broadcast model, if a message is delivered, it is ....
....of us: 1. We believe that our protocols are very close to the maximum level of concurrency achievable. However with clever optimizations, it might be possible to develop algorithms that provide a higher level of concurrency. Although some theoretical work exist on broadcast consensus protocols [69, 73], we do not have a characterization of an optimal algorithm. 2. The above remark is especially true for the semantic ordering protocol: sites can relax a total order if their sequence of operations invocations is equivalent to the one defined by the total order. However, agreeing on an equivalent ....
L. E. Moser, P. M. Melliar-Smith, and V. Agrawala. Necessary and sufficient conditions for broadcast consensus protocols. Journal of Distributed Computing, 7(2):12--27, December 1993.
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