An Implementation of an Optimum-Time Firing Squad Synchronization Algorithm on Two-Dimensional Arrays

In the present paper, we propose a new implementation of an optimum-time synchronization algorithm that can synchronize any rectangle array of size m × n with a general at one corner in m + n + max(m, n) - 3 steps.