LIPIcs.DISC.2018.47.pdf
- Filesize: 361 kB
- 3 pages
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 1/4um (k-1/k), 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.
Feedback for Dagstuhl Publishing