About 4-states Solutions to the Firing Squad Synchronization Problem

Jean-Baptiste Yunès (1) , Naoki Kamikawa , Hiroshi Umeo

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

We present some elements of a new family of time-optimal solutions to a less restrictive firing squad synchronization problem. These solutions are all built on top of some elementary algebraic cellular automata. Thus, this gives a very new insight on the problem and a more general way of computing on cellular automata.

Mots clés: synchronization; cellular automata; parallel computation

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Jean-Baptiste Yunès, Naoki Kamikawa, Hiroshi Umeo. About 4-states Solutions to the Firing Squad Synchronization Problem. ACRI 2008, Sep 2008, Yokohama, Japan. pp.108-113, ⟨10.1007/978-3-540-79992-4_14⟩. ⟨hal-00326644⟩