State-Efficient firing squad synchronization protocols for communication-restricted cellular automata

Authors:
Hiroshi Umeo;Takashi Yanagihara;Masaru Kanazawa
Affiliations:
Univ of Osaka Electro-Communication, Osaka, Japan;Univ of Osaka Electro-Communication, Osaka, Japan;Univ of Osaka Electro-Communication, Osaka, Japan
Venue:
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Year:
2006

Citing 10
Cited 1

A six-state minimal time solution 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
Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton

Parallel Computing - Special issue on cellular automata: from modeling to applications
Smaller solutions for the firing squad

Theoretical Computer Science
A design of real-time non-regular sequence generation algorithms and their implementations on cellular automata with 1-bit inter-cell communications

Fundamenta Informaticae - Special issue on cellular automata
Linear Time Language Recognition on Cellular Automata with Restricted Communication

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Real-time generation of primes by a 1-bit-communication cellular automaton

Fundamenta Informaticae - Special issue on cellular automata
Bounding the firing synchronization problem on a ring

Theoretical Computer Science
Computation: finite and infinite machines

Computation: finite and infinite machines
A synchronization problem on 1-bit communication cellular automata

ICCS'03 Proceedings of the 1st international conference on Computational science: PartI

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

PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study a trade-off between internal states and communication bits in firing squad synchronization protocols for k-bit communication-restricted cellular automata (CAk−bit) and propose several time-optimum state-efficient bit-transfer-based synchronization protocols It is shown that there exists a 1-state CA5−bit that can synchronize any n cells in 2n-2 optimum-step The result is interesting, since we know that there exists no 4-state synchronization algorithm on conventional O(1)-bit communication cellular automata A bit-transfer complexity is also introduced to measure the efficiency of synchronization protocols We show that Ω (n logn) bit-transfer is a lower-bound for synchronizing n cells in (2n-2) steps In addition, each optimum-time/non-optimum-time synchronization protocols, presented in this paper, has an O(n2) bit-transfer complexity, respectively.