A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids

by   Reginald Frank, et al.
Texas A&M University

Synchronizing clocks in a distributed system in which processes communicate through messages with uncertain delays is subject to inherent errors. Prior work has shown upper and lower bounds on the best synchronization achievable in a variety of network topologies and assumptions about the uncertainty on the message delays. However, until now there has not been a tight closed-form expression for the optimal synchronization in k-ary m-cubes with wraparound, where k is odd. In this paper, we prove a lower bound of 1/4um(k-1/k), where k is the (odd) number of processes in the each of the m dimensions, and u is the uncertainty in delay on every link. Our lower bound matches the previously known upper bound.


page 1

page 2

page 3

page 4


Optimal Clock Synchronization with Signatures

Cryptographic signatures can be used to increase the resilience of distr...

Tight Lower Bounds for the RMR Complexity of Recoverable Mutual Exclusion

We present a tight RMR complexity lower bound for the recoverable mutual...

Resilience Bounds of Sensing-Based Network Clock Synchronization

Recent studies exploited external periodic synchronous signals to synchr...

A faster algorithm for the FSSP in one-dimensional CA with multiple speeds

In cellular automata with multiple speeds for each cell i there is a pos...

A Sharp Bound on the s-Energy

We derive an (essentially) optimal bound of O(1/ρ s)^n-1 on the s-energy...

Revisionist Simulations: A New Approach to Proving Space Lower Bounds

Determining the space complexity of x-obstruction-free k-set agreement f...

Please sign up or login with your details

Forgot password? Click here to reset