Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings

Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings
复制标题

方阵、环面和环上射击队同步问题的最优时间和通信解

DOI：
10.1007/978-3-540-30550-7_17
复制
发表时间：
2004
期刊：
--
影响因子：
--
通讯作者：
Mimmo Parente
Mimmo Parente
中科院分区：
--
文献类型：
--
作者：
J. Gruska;S. L. Torre;Mimmo Parente

文献摘要

被引文献

相似文献

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.