The Distributed Firing Squad Problem

DOI10.1137/0218068zbMath0679.68051OpenAlexW2071141824MaRDI QIDQ4729333

Brian A. Coan, Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer

Publication date: 1989

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0218068

zbMATH Keywords

synchronizationfault tolerancecomputer networksbyzantine generals problemdistributed firing squad problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Theory of software (68N99)

Related Items (16)

Easy impossibility proofs for distributed consensus problems ⋮ Optimal precision in the presence of uncertainty ⋮ Common knowledge and consistent simultaneous coordination ⋮ Programming simultaneous actions using common knowledge ⋮ Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem ⋮ Time is not a healer ⋮ CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime ⋮ State-efficient realization of fault-tolerant FSSP algorithms ⋮ Continuous consensus via common knowledge ⋮ Continuous Consensus with Failures and Recoveries ⋮ Hundreds of impossibility results for distributed computing ⋮ The complexity of almost-optimal simultaneous coordination ⋮ Near-optimal self-stabilising counting and firing squads ⋮ Simultaneity is harder than agreement ⋮ The firing squad problem revisited ⋮ Different time solutions for the firing squad synchronization problem on basic grid networks

This page was built for publication: The Distributed Firing Squad Problem