Optimal time and communication solutions of firing squad synchronization problems on square arrays, toruses and rings

Authors:
Jozef Gruska;Salvatore La Torre;Mimmo Parente
Affiliations:
Faculty of Informatics, Masaryk University, Brno, Slovakia;Dipartimento di Informatica ed Applicazioni, Università degli Studi di Salerno, Italy;Dipartimento di Informatica ed Applicazioni, Università degli Studi di Salerno, Italy
Venue:
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Year:
2004

Citing 10
Cited 1

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

Theoretical Computer Science
Variations of the firing squad problem and applications

Information Processing Letters
On optimal solutions to the firing squad synchronization problem

Theoretical Computer Science - Special issue on universal machines and computations
Firing squad synchronization problem in reversible cellular automata

Theoretical Computer Science
On time optimal solutions of the firing squad synchronization problem for two-dimensional paths

Theoretical Computer Science
A new kind of science

A new kind of science
The Firing Squad Synchronization Problem on Cayley Graphs

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Cellular Automata: A Discrete Universe

Cellular Automata: A Discrete Universe
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

Cellular ANTomata

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new solution for the Firing Squad Synchronization Problem (FSSP) on two-dimensional square arrays is presented and its correctness is demonstrated in detail. Our new solution is time as well as communication optimal (the so-called minimal time 1-bit solution). In addition, it is shown that the technique developed and the results obtained allow also to solve in optimal time & communication FSSP for several other variants of this problem on networks shaped as square grids (with four Generals), square toruses and rings.