The perfectly synchronized round-based model of distributed computing

DOI10.1016/J.IC.2006.11.003MaRDI QIDQ879602zbMATH OpenOpenAlexFDO

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

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

simulationcomplexityfault-toleranceabstractiondistributed systemssynchronous system models

Mathematics Subject Classification ID

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

Recommendations

• Simplifying fault-tolerance, providing the abstraction of crash failures
• The asynchronous bounded-cycle model
• The Theta-Model: achieving synchrony without clocks
• On the performance of a retransmission-based synchronizer
• From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors

Cites work

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

Cited in

(2)

• Derivation of heard-of predicates from elementary behavioral patterns
• The asynchronous bounded-cycle model

This page was built for publication: The perfectly synchronized round-based model of distributed computing

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