AN APPROXIMATE AGREEMENT ALGORITHM FOR WRAPAROUND MESHES

An appropriate algorithm, the neighboring exchange, for reaching an ap proximate agreement in a wraparound mesh is proposed. The algorithm is characterized by its isotropic nature, which is of particular usefuln ess when applied in any symmetric system. The behavior of this algorit hm can be depicted by recurrence relations which can be used to derive the convergence rate. The convergence rate is meaningful when the alg orithm is used to synchnize clocks. The rate of synchronizing clocks i s derived, and it can be applied to all wraparound meshes with practic al scale. With the recurrence relations, we also prove the correctness of this algorithm.