Early-deciding consensus is expensive

Dolev, Danny; Lenzen, Christoph

doi:10.1145/2484239.2484269

Cited by 10 publications

(9 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…First, without failures, every server receives an A-broadcast message from all of its d predecessors, i.e., (n − 1) · d messages received by each server. This is consistent with the Ω(n 2 f ) worst-case message complexity for synchronous f -resilient consensus algorithms [21]. Second, every failed server is detected by up to d servers, each sending a failure notification to its d successors.…”

Section: Work Per Serversupporting

confidence: 82%

AllConcur

Poke

Hoefler

Glass

2017

Proceedings of the 26th International Symposium on High-Performance Parallel and Distributed Computing

View full text Add to dashboard Cite

Many distributed systems require coordination between the components involved. With the steady growth of such systems, the probability of failures increases, which necessitates scalable fault-tolerant agreement protocols. The most common practical agreement protocol, for such scenarios, is leader-based atomic broadcast. In this work, we propose ALLCONCUR, a distributed system that provides agreement through a leaderless concurrent atomic broadcast algorithm, thus, not suffering from the bottleneck of a central coordinator. In ALLCONCUR, all components exchange messages concurrently through a logical overlay network that employs early termination to minimize the agreement latency. Our implementation of ALLCONCUR supports standard sockets-based TCP as well as high-performance InfiniBand Verbs communications. ALLCONCUR can handle up to 135 million requests per second and achieves 17× higher throughput than today's standard leader-based protocols, such as Libpaxos. Thus, ALLCONCUR is highly competitive with regard to existing solutions and, due to its decentralized approach, enables hitherto unattainable system designs in a variety of fields. *

show abstract

Section: Work Per Serversupporting

confidence: 82%

AllConcur

Poke

Hoefler

Glass

2017

Proceedings of the 26th International Symposium on High-Performance Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

“…With the above proof, the basic solutions with earlystopping [41,79,80] (or early-deciding [83]) DBA can be provided similarly (as the allowed errors for the coordinated H events are relaxed by H = B + δ B ). The early-stopping basic solutions can be viewed as deterministic stabilization time optimization for the non-worst executions where the actual number of the Byzantine nodes is less than f .…”

Section: B Early-synchronizing Solutionmentioning

confidence: 99%

Peaceable Self-Stabilizing Byzantine Pulse Synchronization

Yu¹,

Zhu²,

Yang³

2022

Preprint

View full text Add to dashboard Cite

For reaching fast and efficient self-stabilizing Byzantine pulse synchronization (SSBPS) upon the bounded-delay message-passing networks, we consider the peaceable SSBPS problem where the resource occupation in the stabilized system is required to be as sparse as possible and the stabilization of the system is required to be as fast as possible. To solve it, the decoupled absorption process and emergency process are investigated under a general framework. The constant-time twostage absorption process and more than one kind of emergency process are provided in integrating the merits of temporal trails, approximate agreements, deterministic and randomized Byzantine agreements, and self-stabilizing protocols. With this, not only SSBPS but self-stabilizing Byzantine clock synchronization can be fast established and efficiently maintained. In the optimalresilient basic solutions, the deterministic linear stabilization time and the stabilized resource occupation are all optimized to those of the underlying primitives, which is optimal in the presence of Byzantine faults under the classical static adversary. In the hybrid solutions, faster stabilization can be expected with a worst-case deterministic stabilization time. In all solutions, the stabilized resource occupation is at most at the order of approximate agreement, which is a good property in considering real-world ultra-high-reliable hard-real-time applications where pulse synchronization is expected to be established before all upper-layer functions and to be efficiently maintained when the upper-layer functions are in service.

show abstract

“…Algorithm 4 requires Ω(r) messages and its message delay is 3. On the other hand, an optimal atomic broadcast protocol [47,48] has a message delay of 3 with Ω(n) messages, and the best genuine faulttolerant atomic multicast known to date 6 message delays with Ω(r 2 ) messages [45]. With the additional message delay to send votes, this makes fault-tolerance expensive at first glance.…”

Section: Fault-tolerancementioning

confidence: 99%

G-Dur

Ardekani¹,

Sutra

Shapiro³

2014

Proceedings of the 15th International Middleware Conference on - Middleware '14

View full text Add to dashboard Cite

A large family of distributed transactional protocols have a common structure, called Deferred Update Replication (DUR). DUR provides dependability by replicating data, and performance by not re-executing transactions but only applying their updates. Protocols of the DUR family differ only in behaviors of few generic functions. Based on this insight, we offer a generic DUR middleware, called G-DUR, along with a library of finely-optimized plug-in implementations of the required behaviors. This paper presents the middleware, the plugins, and an extensive experimental evaluation in a geo-replicated environment. Our empirical study shows that: (i) G-DUR allows developers to implement various transactional protocols under 600 lines of code; (ii) It provides a fair, apples-to-apples comparison between transactional protocols; (iii) By replacing plugs-ins, developers can use G-DUR to understand bottlenecks in their protocols; (iv) This in turn enables the improvement of existing protocols; and (v) Given a protocol, G-DUR helps evaluate the cost of ensuring various degrees of dependability.

show abstract

Early-deciding consensus is expensive

Cited by 10 publications

References 31 publications

AllConcur

AllConcur

Peaceable Self-Stabilizing Byzantine Pulse Synchronization

G-Dur

Contact Info

Product

Resources

About