Affiliations: Department of Computer and Information Science, University of Pennsylvania, 19104 Philadelphia, PA, U.S.A. [email protected] | Dipartimento di Informatica ed Applicazioni, Università degli Studi di Salerno, 84081 Baronissi, Italy. {napoli,parente}@dia.unisa.it
Note: [] Address for correspondence: Department of Computer and Information Science, University of Pennsylvania, 19104 Philadelphia, PA, U.S.A
Note: [] Address for correspondence: Dipartimento di Informatica ed Applicazioni, Università degli Studi di Salerno, 84081 Baronissi, Italy
Abstract: We are given a line of n identical processors (finite automata) that work synchronously. Each processor can transmit just one bit of information to the adjacent processors (if any) to the left and to the right. The computation starts at time 1 with the leftmost processor in an initial state and all other processors in a quiescent state. Given the time f(n), the problem is to set (synchronize) all the processors in a particular state for the first time, at the very same instant f(n). This problem is also known as the Firing Squad Synchronization Problem and was introduced by Moore in 1964. Mazoyer has given a minimal time solution with the least number of different states (six) and very recently he has given a minimal time solution for the constrained problem in which adjacent processors can exchange only one bit. In this paper we present solutions that synchronize the line at a given time, expressed as a function of n. In particular we give solutions that synchronize at the times nlogn, n√n, n2 and 2n. Moreover we also show how to compose solutions in such a way to obtain synchronizing solutions for all times expressed by polynomials with nonnegative coefficients. Clearly all such solutions work also in the general case when the bit constraint is relaxed.
