| GRUSKA, Jozef, Salvatore LA TORRE, Margherita NAPOLI and Mimmo PARENTE. Different time solutions for the firing squad synchronization problem on basic grid networks. RAIRO - Theoretical Informatics and Applications. EDP, 2006, Vol. 40, No. 2, p. 177-206. ISSN 0988-3754. |
Other formats:
BibTeX
LaTeX
RIS
@article{706279,
author = {Gruska, Jozef and La Torre, Salvatore and Napoli, Margherita and Parente, Mimmo},
article_number = {No. 2},
keywords = {Firing Squad Synchronization Problems},
language = {eng},
issn = {0988-3754},
journal = {RAIRO - Theoretical Informatics and Applications},
title = {Different time solutions for the firing squad synchronization problem on basic grid networks},
volume = {Vol. 40},
year = {2006}
}
TY - JOUR
ID - 706279
AU - Gruska, Jozef - La Torre, Salvatore - Napoli, Margherita - Parente, Mimmo
PY - 2006
TI - Different time solutions for the firing squad synchronization problem on basic grid networks
JF - RAIRO - Theoretical Informatics and Applications
VL - Vol. 40
IS - No. 2
SP - 177-206
EP - 177-206
PB - EDP
SN - 09883754
KW - Firing Squad Synchronization Problems
N2 - 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.
ER -
GRUSKA, Jozef, Salvatore LA TORRE, Margherita NAPOLI and Mimmo PARENTE. Different time solutions for the firing squad synchronization problem on basic grid networks. \textit{RAIRO - Theoretical Informatics and Applications}. EDP, 2006, Vol. 40, No. 2, p.~177-206. ISSN~0988-3754.
|
