Simple new algorithms which solve the firing squad synchronization problem: a 7-states 4n-steps solution

Authors:
Jean-Baptiste Yunès
Affiliations:
LIAFA, Université Paris 7 Denis Diderot, Paris, France
Venue:
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Year:
2007

Citing 6
Cited 0

A six-state minimal time solution to the firing squad synchronization problem

Theoretical Computer Science
Seven-state solutions to the Firing Squad Synchronization Problem

Theoretical Computer Science
Smaller solutions for the firing squad

Theoretical Computer Science
An Efficient Mapping Scheme for Embedding Any One-Dimensional Firing Squad Synchronization Algorithm onto Two-Dimensional Arrays

ACRI '01 Proceedings of the 5th International Conference on Cellular Automata for Research and Industry
Computation: finite and infinite machines

Computation: finite and infinite machines
A design of symmetrical six-state 3n-step firing squad synchronization algorithms and their implementations

ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new family of solutions to the firing squad synchronization problem. All these solutions are built with a few finite number of signals, which lead to simple implementations with 7 or 8 internal states. Using one of these schemes we are able to built a 7-states 4n+O(log n)-steps solution to the firing squad synchronization problem. These solutions not only solves the unrestricted problem (initiator at one of the two ends), but also the problem with initiators at both ends and the problem on a ring.