B. A. Coan, D. Dolev, C. Dwork, and L. Stockmeyer. The distributed firing squad problem. SIAM J. Comput., 18(5):990-- 1012, Oct. 1989.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....[40] extends the Karlin Yao bound to hold even under cer tain restrictions on the power of the adversary . The paper [46] contains some lower bounds on the number of processes required to reach consensus in various fault and timing models. Proof techniques are based on scenarios. The paper [31] contains lower bounds for the number of processes required to solve the Byzantine firing squad problem, using various fault and timing mod els. A nice touch here is that one of the results is proved by reducing weak Byzantine agreement to it rather than by a direct proof. For the other results, ....

B. Coan, D. Dolev, C. Dwork, and L. Stock- meyer. The distributed firing squad problem. In Proceedings of the 17 th Annual ACM Symposium on Theory of Computing, Providence, Rhode Island, pages 335-345, May 1985.

....is available. In a system with authentication, a processor can sign a message in an unforgeable way so that all other processors can reliably determine the original sender of the message [9] The Byzantine firing squad problem with authentication is examined by Coan, Dolev, Dwork, and Stockmeyer [5]. In a synchronous system, information can be conveyed by the absence of a signal as well as by an explicit signal. We distinguish a particular message, called the null message ( to represent the absence of an explicit signal; all other messages are simply called signals. A processor is said to ....

....Byzantine firing squad algorithm is identical to that of the Byzantine agreement algorithm. Since it is known that n 3f is sufficient for Byzantine agreement [18] the Byzantine firing squad problem can also be solved whenever n 3f It has also been shown by Coan, Dolev, Dwork, and Stockmeyer [5] (by reducing Lamport s weak Byzantine agreement problem [17] t9 ,the Byzantine firing squad problem) and by Fischer, Lynch, and Merrittt , 14 directly) that the Byzantine firing squad problem annot be solved ifiIS n 3f All of the deterministic Byzantine agreement algorithms that we know of ....

[Article contains additional citation context not shown here]

Coan B, Dolev D, Dwork C, Stockmeyer L: The distributed firing squad problem (preliminary version). Proc. 17th Ann. ACM Symposium on the Theory of Computing, New York, 1985 pp. 335-345.

....firing squad The Byzantine firing squad problem addresses a form of synchronization in the presence of Byz 34 antine failures. The problem is to synchronize a response to an input stimulus. The response is to enter a designated FIRE state. The problem was studied originally in [3] In [4], a reduction of weak agreement to the Byzantine firing squad problem demonstrates that the latter is impossible to solve in inadequate graphs. We provide a direct proof that a simple variant of the original problem is impossible to solve in inadequate graphs. In the original version, the ....

Coan B, Dolev D, Dwork C, Stockmeyer L (1985) The distributed firing squad problem, Proceedings of the 17th STOC, May 6-8, 1985, Providence, RI

....of the omissions failure model we consider. As a result, our high level protocols have effective implementations in these failure models as low level, standard protocols that are optimal in all runs. Consider, for example, the following version of the distributed firing squad problem (cf. BL] [CDDS], R] An external source may send start signals to some of the processors in the system at unpredictable, possibly different, times. It is required that (i) if any nonfaulty processor receives a start signal, then all nonfaulty processors perform an irreversible firing action at some later ....

.... distributed firing squad problem in the introduction is implementable in the variants of the omissions model, but is not implementable in more malevolent models, in which a faulty processor can falsely claim to have received a start message and otherwise seem to behave correctly (see [BL] and [CDDS] for definitions of versions of the firing squad problem that are implementable in the more malicious models) In the generalized omissions model, we have shown how to derive optimal protocols for nontrivial simultaneous choice problems, requiring processors to perform polynomial space ....

B. Coan, D. Dolev, C. Dwork, and L. Stockmeyer, The distributed firing squad problem, Proceedings of the Seventeenth $TOCj 1985, pp. 335-345.

....(such as deciding on an output bit) from a set of actions and to perform that action simultaneously. Instances of simultaneous choice problems include simultaneous versions of many well known problems, such as Reliable Broadcast [19] Byzantine Agreement [14,20] and Distributed Firing Squad [1,4,22]. For example, in Byzantine Agreement, each processor starts with an input bit and chooses an output bit. All nonfaulty processors must choose the same output bit and this bit must be some processor s input bit. In Simultaneous Byzantine Agreement [5,6] all nonfaulty processors must choose their ....

Brian A. Coan, Danny Dolev, Cynthia Dwork, and Larry Stockmeyer. The distributed firing squad problem. SIAM Journal on Computing, 18(5):990--1012, October 1989.

....of the omissions failure model we consider. As a result, our high level protocols have effective implementations in these failure models as low level, standard protocols that are optimal in all runs. Consider, for example, the following version of the distributed firing squad problem (cf. BL] [CDDS], R] An external source may send start signals to some of the processors in the system at unpredictable, possibly different, times. It is required that (i) if any nonfaulty processor receives a start signal, then all nonfaulty processors perform an irreversible firing action at some later ....

.... distributed firing squad problem in the introduction is implementable in the variants of the omissions model, but is not implementable in more malevolent models, in which a faulty processor can falsely claim to have received a start message and otherwise seem to behave correctly (see [BL] and [CDDS] for definitions of versions of the firing squad problem that are implementable in the more 48 malicious models) In the generalized omissions model, we have shown how to derive optimal protocols for nontrivial simultaneous choice problems, requiring processors to perform polynomialspace ....

B. Coan, D. Dolev, C. Dwork, and L. Stockmeyer, The distributed firing squad problem, Proceedings of the Seventeenth STOC, 1985, pp. 335-345.

....explicit tests of whether certain facts are common knowledge (cf. DM] HF] These high level protocols are automatically extracted from the problem specification via a few simple manipulations. For example, consider the following simple version of the distributed firing squad problem (cf. BL] [CDDS], R] An external source may send start messages to some of the processors in the system, at unpredictable, possibly different, times. It is required that (i) if some nonfaulty processor receives a start message, all nonfaulty processors should simultaneously perform an irreversible firing ....

.... of the distributed firing squad problem in the introduction is implementable in the variants of the omissions model, but is not implementable in more malevolent models, in which a faulty processor can falsely claim to have received a start message, and otherwise behave correctly (see [BL] and [CDDS] for definitions of similar problems that are implementable in the more malicious models) We have shown how to derive optimal protocols for nontrivial simultaneous choice problems in the generalized omissions model, requiring processors to perform PSPACE computations between consecutive rounds. ....

B. Coan, D. Dolev, C. Dwork, and L. Stockmeyer, The distributed firing squad problem, Proceedings of the Seventeenth STOC, 1985, pp. 335-345.

....within certain bounds. Unfortunately, in practice, the difference in synchronization between any two processor clocks will never be zero. This makes it hard to have all correct processors agree on a common point in time. The problem can be solved by a Distributed Firing Squad (DFS) algorithm [8]. A DFS algorithm runs on a system of N processors, up to T of which may behave maliciously, and has the following two properties: o If any correct processor receives a message to start a DFS synchronization, then at some future time all correct processors will fire (i.e. enter a special ....

Coan, B.A., et al., The Distributed Firing Squad Problem, in: The 17th ACM Symposium on the Theory of Computing, ACM, New York, 1985, pp.335-345.

....can only establish appromixate synchronization between processor clocks. This makes it hard to have all correct processors reach exact agreement about a common point in time. Exact agreement about some point in time can be obtained by means of a Distributed Firing Squad (DFS) algorithm [19]. However, a DFS algorithm can not be used to solve the problem, since, in order to function correctly in the presence of arbitrarily faulty processors, a DFS algorithm requires that the clocks of all correct processors run at the same rate, and that messages communicated between certain ....

Coan, B.A., Dolev, D., Dwork, C., and Stockmeyer, L., The Distributed Firing Squad Problem, in: The 17th ACM Symposium on the Theory of Computing, ACM, New York, 1985, pp.335-345.

No context found.

B. Coan, D. Dolev, C. Dwork and L. Stockmeyer, "The Distributed Firing Squad Problem," Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, May, 1985, pp. 335-345.

....whose values range over an infinite domain. By way of contrast, our design employs finite state clocks and so can be used in digital circuits. The reader should note that the problem of maintaining clocks in step differs from two problems studied earlier, namely, firing squad synchronization [5,6,7] and clock synchronization [8,9] In firing squad synchronization, every participant in a squad operates in one of two modes; initially, all participants are in one mode, and it is required that if ever some participant initiates a synchronization then subsequently all participants enter the ....

B.A. Coan, D. Dolev, C. Dwork and L. Stockmeyer, "The distributed firing squad problem", Siam Journal of Computing, Vol. 18, No. 5, pp. 990-1012 (1989).

No context found.

B. A. Coan, D. Dolev, C. Dwork, and L. Stockmeyer. The distributed firing squad problem. SIAM J. Comput., 18(5):990-- 1012, Oct. 1989.

No context found.

Brian A. Coan, Danny Dolev, Cynthia Dwork, and Larry Stockmeyer. The distributed firing squad problem. SIAM Journal on Computing, 18(5), pages 990--1012, October 1989.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC