DISTRIBUTED FIRING SQUAD PROBLEM.

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

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

Many fault-tolerant distributed algorithms assume a synchronous system. Another common assumption is that all processors begin the algorithm simultaneously, i. e. , at the same step. Typically an algorithm is executed in response to a request from some specific processor, which may in turn be responding to some external request. If the given processor is correct then all correct processors learn of the request simultaneously, so they can indeed begin the algorithm in unison. However, if the processor is faulty then the correct processors may learn of the request at different steps. The authors justify the design assumption of simultaneous starts. Specifically, they provide algorithms to solve the associated synchronization problem, which they call the distributed firing squad problem.

Original languageEnglish
Title of host publicationConference Proceedings of the Annual ACM Symposium on Theory of Computing
PublisherACM (Order n 508850)
Pages335-345
Number of pages11
ISBN (Print)0897911512, 9780897911511
DOIs
StatePublished - 1985
Externally publishedYes

Publication series

NameConference Proceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0734-9025

Fingerprint

Dive into the research topics of 'DISTRIBUTED FIRING SQUAD PROBLEM.'. Together they form a unique fingerprint.

Cite this