On the minimal synchronism needed for distributed consensus
From MaRDI portal
Publication:3768381
DOI10.1145/7531.7533zbMath0631.68022OpenAlexW1964729314MaRDI QIDQ3768381
Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer
Publication date: 1987
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/7531.7533
reliabilityfault tolerancedistributed computingasynchronous systemconsensus problemByzantine generals problemagreement problemcommit problem
Related Items
Reliable synchronization in distributed systems ⋮ Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker ⋮ Consensus in Data Management: From Distributed Commit to Blockchain ⋮ Reliability versus cost: Design of a probabilistic broadcast algorithm ⋮ A necessary and sufficient condition for transforming limited accuracy failure detectors ⋮ From binary consensus to multivalued consensus in asynchronous message-passing systems ⋮ The Theta-Model: achieving synchrony without clocks ⋮ The Heard-Of model: computing in distributed systems with benign faults ⋮ On implementing omega in systems with weak reliability and synchrony assumptions ⋮ On the weakest failure detector ever ⋮ Generalized Paxos made Byzantine (and less complex) ⋮ A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems ⋮ Highly concurrent logically synchronous multicast ⋮ A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling ⋮ Possibility and impossibility results in a shared memory environment ⋮ In search of lost time ⋮ Efficient execution of nondeterministic parallel programs on asynchronous systems ⋮ Time is not a healer ⋮ Byzantine agreement with homonyms in synchronous systems ⋮ Wait-free computing ⋮ On real-time and non real-time distributed computing ⋮ A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment ⋮ A Paxos based algorithm to minimize the overhead of process recovery in consensus ⋮ Failure detectors encapsulate fairness ⋮ On specifications and proofs of timed circuits ⋮ Building blocks of sharding blockchain systems: concepts, approaches, and open problems ⋮ About informatics, distributed computing, and our job: a personal view ⋮ Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler ⋮ Low complexity Byzantine-resilient consensus ⋮ Active disk Paxos with infinitely many processes ⋮ Transaction commit in a realistic timing model ⋮ Randomized leader election ⋮ Failure detectors as type boosters ⋮ Initial failures in distributed computations ⋮ On the minimum requirements for independent recovery in distributed systems ⋮ Atomic snapshots using lattice agreement ⋮ Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links ⋮ Design and analysis of dynamic leader election protocols in broadcast networks ⋮ On the use of registers in achieving wait-free consensus ⋮ Hundreds of impossibility results for distributed computing ⋮ Randomized protocols for asynchronous consensus ⋮ Appraising two decades of distributed computing theory research ⋮ The gap in circumventing the impossibility of consensus ⋮ On distributed algorithms in a broadcast domain ⋮ On the power of synchronization between two adjacent processes ⋮ Randomization can be a healer: consensus with dynamic omission failures ⋮ Fault-tolerant critical section management in asynchronous environments ⋮ Tight bounds on the round complexity of distributed 1-solvable tasks ⋮ Efficient parallel algorithms can be made robust ⋮ Fast information sharing in a complete network ⋮ Space-efficient asynchronous consensus without shared memory initialization ⋮ Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures ⋮ Simulating synchronous processors ⋮ The asynchronous bounded-cycle model ⋮ Design of transaction commitment protocols ⋮ Byzantine Agreement Using Partial Authentication ⋮ Communication complexity of fault-tolerant information diffusion ⋮ Authenticated Byzantine Generals in Dual Failure Model ⋮ Revisiting the PAXOS algorithm ⋮ Computing in totally anonymous asynchronous shared memory systems ⋮ Necessary and sufficient conditions for broadcast consensus protocols. ⋮ A classification of wait-free loop agreement tasks ⋮ The epigenetic consensus problem
This page was built for publication: On the minimal synchronism needed for distributed consensus
