The firing squad synchronization problem (FSSP) on cellular automata has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we focus our attention to two-dimensional square synchronizers that can synchronize square arrays and construct a survey on recent developments in their designs and implementations of optimum-time synchronization algorithms for square arrays. A new generalized square synchronization algorithm with an initial general at any position is also presented.
展开▼