Using knowledge to optimally achieve coordination in distributed systems

DOI10.1016/S0304-3975(98)00236-9zbMath0916.68010OpenAlexW2054383044MaRDI QIDQ1292424

Gil Neiger, Rida A. Bazzi

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00236-9

zbMATH Keywords

knowledgecommon knowledgeoptimal algorithmsdistributed coordinationoptimum algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Knowledge representation (68T30)

Related Items

Common knowledge and consistent simultaneous coordination, Unnamed Item, Continuous Consensus with Failures and Recoveries, Knowledge-based programs, The complexity of almost-optimal simultaneous coordination

Cites Work

• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Programming simultaneous actions using common knowledge
• A lower bound for the time to assure interactive consistency
• Common knowledge and consistent simultaneous coordination
• A Characterization of Eventual Byzantine Agreement
• Knowledge and common knowledge in a distributed environment
• Automatically increasing the fault-tolerance of distributed algorithms
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• The possibility and the complexity of achieving fault-tolerant coordination
• Unnamed Item
• Unnamed Item