Paper Info
Title
Various Solutions to the Firing Squad Synchronization Problems
Abstract
We present different classes of solutions to the Firing Squad Synchronization Problem on networks of different shapes. The nodes are finite state processors that work at unison discrete steps. The networks considered are the line, the ring and the square. For all of these models we have considered one and two-way communication modes and also constrained the quantity of information that adjacent processors can exchange each step. We are given a particular time expressed as a function of the number of nodes of the network, f(n) and present synchronization algorithms in time n2, nlogn, n √ n, 2n. The solutions are presented as signals that are used as building blocks to compose new solutions for all times expressed by polynomials with nonnegative coefficients.
Year
Venue
Keywords
2005
CoRR
computational complexity,data structure
Field
DocType
Volume
Discrete mathematics,Synchronization,Combinatorics,Polynomial,Unison,Firing squad synchronization problem,Finite state,Synchronization algorithm,Mathematics
Journal
abs/cs/0511044
Citations 
PageRank 
References 
0
0.34
16
Authors
4
Name
Order
Citations
PageRank
Jozef Gruska1182.90
Salvatore La Torre252.63
Margherita Napoli320521.30
Mimmo Parente401.35