Brief announcement: A tight lower bound for clock synchronization in odd-ary m-toroids

Reginald Frank and Jennifer L. Welch. In this paper we show a tight closed-form expression for the optimal clock synchronization in k-ary m-cubes with wraparound, where k is odd. This is done by proving a lower bound of 14 umk k1 , where k is the (odd) number of processes in each of the m dimensions, and u is the uncertainty in delay on every link. Our lower bound matches the previously known upper bound.

Brief announcement: A tight lower bound for clock synchronization in odd-ary m-toroids Conference Paper