Time-driven algorithms for distributed control

TL;DR: This paper analyses how the symmetry of a processor network innuences the existence of a solution for the network orientation problem and lower bounds on the message complexity of orientation and algorithms achieving these bounds are given.

TL;DR: This paper introduces the Asynchronous Bounded-Cycle (ABC) model, which considerably relaxes the Theta-Model proposed by Le Lann and Schmid, and shows that clock synchronization and lock-step rounds can easily be implemented and proved correct in the ABC model, even in the presence of Byzantine failures.

TL;DR: This work explains why it is reasonable to abstract away from the physical details in sequential computations and shows why certain common approaches in the theory of parallel complexity do not give useful information about the actual complexity of the parallel computation.

TL;DR: An election algorithm is presented for synchronous rings with unknown size that is linear in the number of processes, but exponential in the smallest identity of any process.