F. Pedone, A. Schiper, P. Urban, and D. Cavin. Solving agreement problems with weak ordering oracles. In Proceedings of the 4th European Dependable Computing Conference (EDCC-4), volume 2485 of Lecture Notes in Computer Science, pages 44--61. Springer-Verlag, 2002. 13  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
How Bad Are Wrong Suspicions? Towards Adaptive.. - Sampaio.. (2003) (Correct)
....timeouts. For one side, the failure detection service must avoid, as much as possible, wrong suspicions. To achieve that, timeouts need to be set large enough to cope with periods of heavy system load. This, in turn increases detection latency, which also impacts performance when failures occur [4, 8, 12], thus constraining timeouts not to be set too large. task of detecting slow processes to the higher level protocols. The remaining of the paper is structured in the following way. In Section 2 we present our assumptions. We also give a brief review of the non adaptive consensus protocol studied ....
....use of failure detection services with different levels of QoS. As pointed out before, the simulation results attained prompted us to propose an alternative approach to separate efficiency concerns in the design of crash detection based fault tolerant distributed protocols for asynchronous systems [12]. This is done in Section 4, where the concept of slowness oracles is introduced. This section also presents a generic design for an adaptive consensus protocol, based on the definition of a slowness oracle for the conventional non adaptive consensus protocol previously studied. In Section 5, a ....
[Article contains additional citation context not shown here]
P. Pedone, A. Schiper, P. Urban, and D. Cavin. Solving agreement problems with weak ordering oracles. In Proceedings European Dependable Computing Conference (EDCC-4), Toulouse, France, Oct 2002.
Total Order Broadcast and Multicast Algorithms: Taxonomy.. - Défago, Schiper, Urbán (2003) (3 citations) Self-citation (Schiper Urb) (Correct)
No context found.
PEDONE, F., SCHIPER, A., URB AN, P., AND CAVIN, D. 2002. Solving agreement problems with weak ordering oracles. In Proc. 4th European Dependable Computing Conference (EDCC-4). LNCS, vol. 2485. Springer-Verlag, Toulouse, France, 44--61.
Solving Agreement Problems with Weak Ordering Oracles - Pedone, Schiper, Urban, Cavin (2002) (9 citations) Self-citation (Pedone Schiper Urban Cavin) (Correct)
No context found.
F. Pedone, A. Schiper, P. Urban, and D. Cavin. Solving Agreement Problems with Weak Ordering Oracles. TR IC/2002.
Failure Detection vs Group Membership in Fault-Tolerant.. - Schiper (2002) (1 citation) Self-citation (Schiper) (Correct)
....the dilemma of fine tuning the failure detection mechanism. Randomisation is one solution, since it allows us to solve consensus in asynchronous systems [1,23] However, randomisation leads to slow algorithms. Another solution is to augment the asynchronous system with weak ordering oracles [ 22], which order Even if wrong suspicions have less impact on performance than process exclusion, they still have a negative impact. messages frequently, but might also deliver messages out of order. Weak ordering oracles capture the behaviour of network multicast in state of the art local area ....
....networks: if messages are multicast in a local area network, there is a good chance that some of them will be received by all processors in the same order. Experiments have shown that if the interval between broadcast is around 0. 15 ms, then very few messages are received out of order (about 5 ) [ 22]. 5.1 Weak Ordering Oracles Weak ordering oracles are defined by two primitives, W ABroadcast(r,m) and W ADeliver(r,m) The first primitive asks the oracle to broadcast m. The second primitive corresponds to the delivery of m by the oracle. The parameter r groups messages with the same r value ....
[Article contains additional citation context not shown here]
F. Pedone, A. Schiper, P. Urban, and D. Cavin. Solving Agreement Problems with Weak Ordering Oracles. TR IC/2002/010, EPFL, March 2002. Appears also as Technical Report HPL-2002-44, Hewlett-Packard Laboratories, March 2002.
Weak Ordering Oracles for Failure Detection-Free Systems - Pedone, Schiper, Urban, Cavin Self-citation (Pedone Schiper Cavin) (Correct)
....When messages are broadcast with a period greater than 0.14 milliseconds, very few messages are received out of order (only about 5 ) 100 90 80 70 60 50 40 30 20 10 0 0.02 I I 0.04 0.06 0.08 0.1 0.12 0.14 0. 16 Messable interval (ms) Figure l: Spontaneous total order property Briefly (see [3] for more details) our oracle is defined by the primitives W ABroadcast(r, ra) query to broadcast message ra) and W ADeliver(r, ra) delivery of ra) The integer parameter r groups messages with the same r value. The weak ordering property holds for r if there exists a message ra such that each ....
....(m3 is the first message with r: 2 delivered by Pl, P2, and p3) but does not hold for either r: 0 or r: 1. We define the Weak Atomic Broadcast (WAB) oracle as the oracle that fulfills the weak ordering property infinitely often. Consensus and atomic broadcast can be solved using the WAB oracle [3]. Actually consensus can be solved with an oracle weaker than the WAB or acle [3] When using weak ordering oracles, atomic broadcast algorithms and other agreement related algorithms do not suffer from the failure detector dilemma. Since they do not rely on failure detectors, there is no tuning ....
[Article contains additional citation context not shown here]
F. Pedone, A. Schiper, P. Urbgm, and D. Cavin. Solving agreement problems with weak ordering oracles. Technical Report HPL-2002.
How Fast Can Eventual Synchrony Lead to Consensus? - Dutta, Guerraoui, Lamport (2005) (Correct)
No context found.
F. Pedone, A. Schiper, P. Urban, and D. Cavin. Solving agreement problems with weak ordering oracles. In Proceedings of the 4th European Dependable Computing Conference (EDCC-4), volume 2485 of Lecture Notes in Computer Science, pages 44--61. Springer-Verlag, 2002. 13
Low Complexity Byzantine-Resilient Consensus - Correia, Neves, Lung, Verissimo (2003) (1 citation) (Correct)
No context found.
F. Pedone, A. Schiper, P. Urb an, and D. Cavin. Solving agreement problems with weak ordering oracles. In Proceedings of the Fourth European Dependable Computing Conference, pages 44--61, October 2002.
How to Tolerate Half Less One Byzantine Nodes in.. - Correia, Neves.. (2004) (Correct)
No context found.
F. Pedone, A. Schiper, P. Urb an, and D. Cavin. Solving agreement problems with weak ordering oracles. In Proceedings of the Fourth European Dependable Computing Conference, pages 44--61, October 2002.
How to Tolerate Half Less One Byzantine Nodes in.. - Correia, Neves.. (2004) (Correct)
No context found.
F. Pedone, A. Schiper, P. Urb an, and D. Cavin. Solving agreement problems with weak ordering oracles. In Proceedings of the Fourth European Dependable Computing Conference, pages 44--61, Oct. 2002.
From Consensus to Atomic Broadcast: Time-Free.. - Correia, Neves.. (2004) (Correct)
No context found.
F. Pedone, A. Schiper, P. Urb an, and D. Cavin. Solving agreement problems with weak ordering oracles. In Proceedings of the Fourth European Dependable Computing Conference, pages 44--61, October 2002.
From Byzantine Agreement to Practical Survivability - Malkhi (2002) (1 citation) (Correct)
No context found.
F. Pedone, A. Schiper, P. Urban and D. Cavin. Solving agreement problems with weak ordering oracles. Technical Report IC/2002.
Low Complexity Byzantine-Resilient Consensus - Correia, Neves, Lung, Verissimo (2003) (1 citation) (Correct)
No context found.
F. Pedone, A. Schiper, P. Urb an, and D. Cavin. Solving agreement problems with weak ordering oracles. In Proceedings of the Fourth European Dependable Computing Conference, pages 44--61, October 2002.
Initial Roadmap on Middleware For Composable and Dynamically.. - Midas (2003) (Correct)
No context found.
F. Pedone, A. Schiper, P. Urbn, and D. Cavin. Solving Agreement Problems with Weak Ordering Oracles. In Proc. 4th European Dependable Computing Conference (EDCC-4), Toulouse, France, October 2002.
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