Fast deterministic consensus in a noisy environment

DOI10.1016/S0196-6774(02)00220-1zbMath1051.68148OpenAlexW2010272080MaRDI QIDQ4806591

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

Randomized algorithmsDistributed computingConsensusShared memoryPerturbation analysisWait-freeAgreement protocolsNoisy scheduling

Mathematics Subject Classification ID

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

Related Items (3)

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 ⋮ Fault-Tolerant Consensus with an Abstract MAC Layer.

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