Smallest implementations of optimum-time firing squad synchronization algorithms for one-bit-communication cellular automata

Authors:
Hiroshi Umeo;Takashi Yanagihara
Affiliations:
Univ. of Osaka Electro-Communication, Neyagawa-shi, Osaka, Japan;Univ. of Osaka Electro-Communication, Neyagawa-shi, Osaka, Japan
Venue:
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Year:
2011

Citing 12
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
On optimal solutions to the firing squad synchronization problem

Theoretical Computer Science - Special issue on universal machines and computations
Generation of Primes by a One-Dimensional Real-Time Iterative Array

Journal of the ACM (JACM)
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
Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Computation: finite and infinite machines

Computation: finite and infinite machines
A State-Efficient Mapping Scheme for Designing Two-Dimensional Firing Squad Synchronization Algorithms

Fundamenta Informaticae - SPECIAL ISSUE MCU2004
State-Efficient One-Bit Communication Solutions for Some Classical Cellular Automata Problems
A seven-state time-optimum square synchronizer

ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
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
State-Efficient firing squad synchronization protocols for communication-restricted cellular automata

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Synchronization of large-scale networks is an important and fundamental computing primitive in parallel and distributed systems. The firing squad synchronization problem (FSSP) on cellular automata (CA) has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms has been proposed for not only one-dimensional but two-dimensional arrays. In the present paper, we study the FSSP on 1-bit-communication cellular automata, CA1-bit. The CA1-bit is a weakest subclass of CAs in which the amount of inter-cell communication bits transferred among neighboring cells at one step is restricted to 1-bit. We propose two state-efficient implementations of optimum-time FSSP algorithms for the CA1-bit and show that the communication restriction has no influence on the design of optimum-time FSSP algorithms. The implementations proposed are the smallest ones, known at present.