The firing squad synchronization problem (FSSP) has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms has been proposed for not only one-dimensional but two-dimensional arrays. In the present paper, we propose a new recursive-halving based optimum-time synchronization algorithm that can synchronize any rectangle two-dimensional (2D) arrays of size m × n with a general at one corner in m + n + max(m, n) - 3 steps.
展开▼
