TY - GEN
T1 - DISTRIBUTED FIRING SQUAD PROBLEM.
AU - Coan, Brian A.
AU - Dolev, Danny
AU - Dwork, Cynthia
AU - Stockmeyer, Larry
PY - 1985
Y1 - 1985
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0021936108&partnerID=8YFLogxK
U2 - 10.1145/22145.22182
DO - 10.1145/22145.22182
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0021936108
SN - 0897911512
SN - 9780897911511
T3 - Conference Proceedings of the Annual ACM Symposium on Theory of Computing
SP - 335
EP - 345
BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing
PB - ACM (Order n 508850)
ER -