A six-state minimal time solution to the firing squad synchronization problem
Theoretical Computer Science
Smaller solutions for the firing squad
Theoretical Computer Science
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
AMS '07 Proceedings of the First Asia International Conference on Modelling & Simulation
A Simple Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays
CSSIM '09 Proceedings of the 2009 International Conference on Computational Intelligence, Modelling and Simulation
A new time-optimum synchronization algorithm for two-dimensional cellular arrays
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
UC'05 Proceedings of the 4th international conference on Unconventional Computation
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
| Hi-index | 0.00 |
We study a firing squad synchronization problem that gives a finite-state protocol for synchronizing large-scale cellular automata. In this paper, we give a survey on recent developments in designing optimum- and non-optimum-time synchronization algorithms and present their state-efficient implementations for two-dimensional cellular arrays. Several simple, state-efficient mapping schemes are proposed for embedding one-dimensional firing squad synchronization algorithms onto two-dimensional arrays. Throughout this paper we focus our attention to the algorithms for synchronizing two-dimensional rectangular arrays with the general at one corner of the array.