A new time-optimum synchronization algorithm for two-dimensional cellular arrays

Authors:
Hiroshi Umeo;Hiroki Uchino
Affiliations:
Univ. of Osaka Electro-Communication, Neyagawa-shi, Osaka, Japan;Univ. of Osaka Electro-Communication, Neyagawa-shi, Osaka, Japan
Venue:
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Year:
2007

Citing 4
Cited 3

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

Theoretical Computer Science
A State-Efficient Mapping Scheme for Designing Two-Dimensional Firing Squad Synchronization Algorithms

Fundamenta Informaticae - SPECIAL ISSUE MCU2004
A twelve-state optimum-time synchronization algorithm for two-dimensional rectangular cellular arrays

UC'05 Proceedings of the 4th international conference on Unconventional Computation
Several new generalized linear- and optimum-time synchronization algorithms for two-dimensional rectangular arrays

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality

A New Time-Optimum Synchronization Algorithm for Rectangle Arrays

Fundamenta Informaticae - Membrane Computing
Two-dimensional cellular automata synchronizers

CI'10 Proceedings of the 4th WSEAS international conference on Computational intelligence
A New Time-Optimum Synchronization Algorithm for Rectangle Arrays

Fundamenta Informaticae - Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed so far. In the present paper, we propose a new optimum-time algorithm for synchronizing two-dimensional cellular automata. The algorithm can synchronize any rectangular array of size m × n in optimum m + n + max(m, n) - 3 steps.