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. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Gruska, J., La Torre, S., & Parente, M. (2004). Optimal time and communication solutions of firing squad synchronization problems on square arrays, toruses and rings. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3340, 200–211. https://doi.org/10.1007/978-3-540-30550-7_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
