Fast deterministic consensus in a noisy environment

DOI10.1016/S0196-6774(02)00220-1MaRDI QIDQ4806591zbMATH OpenOpenAlexFDO

Authors James Aspnes

Publication date 14 May 2003

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0196-6774(02)00220-1

zbMATH Keywords

Distributed computingConsensusShared memoryPerturbation analysisRandomized algorithmsWait-freeAgreement protocolsNoisy scheduling

Mathematics Subject Classification ID

Randomized algorithms (68W20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Fast deterministic consensus in a noisy environment
• Fast randomized consensus using shared memory
• Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor
• Fast scalable deterministic consensus for crash failures
• Faster randomized consensus with an oblivious adversary

Cited in

(6)

• Fast deterministic consensus in a noisy environment
• Fault-tolerant consensus with an abstract MAC layer
• Fast consensus in networks of bounded degree.
• The entropy of a distributed computation random number generation from memory interleaving
• A modular approach to shared-memory consensus, with applications to the probabilistic-write model
• Fast plurality consensus in regular expanders

This page was built for publication: Fast deterministic consensus in a noisy environment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4806591)