State-efficient time-optimum synchronization protocols for two-dimensional arrays: a survey

Authors:
Hiroshi Umeo
Affiliations:
Univ. of Osaka Electro-Communication, Faculty of Information Science and Technology, Neyagawa-shi, Osaka, Japan
Venue:
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Year:
2006

Citing 5
Cited 0

A six-state minimal time solution 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
Correction, Optimization and Verification of Transition Rule Set for Waksman's Firing Squad Synchronization Algorithm

Proceedings of the Fourth International Conference on Cellular Automata for Research and Industry: Theoretical and Practical Issues on Cellular Automata
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The firing squad synchronization problem has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we give a survey on recent developments in firing squad synchronization algorithms for synchronizing large-scale two-dimensional cellular automata. Several new algorithms and their stateefficient implementations are also given.