Fast gossiping on square mesh computers

This paper considers the gossiping problem on square mesh computers under the following assumption: each node can send a token through each of the links incident on it in a step, but since each link can carry at most one token in one direction in a step (i.e., each link is half-duplex), either one of the two nodes connected by a link can send a token through it in a step. Under this assumption, we propose a gossiping algorithm for square mesh computers which asymptotically achieves the minimum gossiping time.