Different time solutions for the firing squad synchronization problem on basic grid networks
| Authors | |
|---|---|
| Year of publication | 2006 |
| Type | Article in Periodical |
| Magazine / Source | RAIRO - Theoretical Informatics and Applications |
| MU Faculty or unit | |
| Citation | |
| Field | Informatics |
| Keywords | Firing Squad Synchronization Problems |
| Description | We present several solutions to the Firing Squad Synchronization Problem on grid networks of different shapes. The nodes are finite state processors that work in unison with other processors and in synchronized discrete steps. The networks we deal with are: the line, the ring and the square. For all of these models we consider one- and two-way communication modes and we also constrain the quantity of information that adjacent processors can exchange at each step. We first present synchronization algorithms that work in time $n^2$, $n \log n$, $n\sqrt n$, $2^n$, where n is a total number of processors. Synchronization methods are described through so called signals that are then used as building blocks to compose synchronization solutions for the cases that synchronization times are expressed by polynomials with nonnegative coefficients. |
| Related projects: |