The perfectly synchronized round-based model of distributed computing

DOI10.1016/j.ic.2006.11.003zbMath1115.68030OpenAlexW2106364801MaRDI QIDQ879602

Rachid Guerraoui, Carole Delporte-Gallet, Bastian Pochon, Hugues Fauconnier

Publication date: 14 May 2007

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2006.11.003

zbMATH Keywords

complexitysimulationdistributed systemsfault-toleranceabstractionsynchronous system models

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Programming simultaneous actions using common knowledge
• A lower bound for the time to assure interactive consistency
• On the hardness of failure-sensitive agreement problems.
• Simplifying fault-tolerance
• Automatically increasing the fault-tolerance of distributed algorithms
• Early stopping in Byzantine agreement
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Time, clocks, and the ordering of events in a distributed system
• Unreliable failure detectors for reliable distributed systems
• Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
• Unnamed Item