On randomization versus synchronization in distributed systems

DOI10.1007/978-3-540-27836-8_100MaRDI QIDQ5466450zbMATH OpenOpenAlexFDO

Authors H. Völzer

Publication date 24 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99859

Mathematics Subject Classification ID

Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Randomized protocols for asynchronous consensus
• Hundreds of impossibility results for distributed computing
• Tight bounds for asynchronous randomized consensus
• Distributed Computing
• Linearizable implementations do not suffice for randomized distributed computation

Cited in

(3)

• Common randomness and distributed control: A counterexample
• scientific article; zbMATH DE number 3858278 (Why is no real title available?)
• Distributed Computing

This page was built for publication: On randomization versus synchronization in distributed systems

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