Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version)

We introduce new techniques for deriving lower bounds on the message complexity in asynchronous distributed computation. These techniques combine the choice of specific patterns of communication delays and crossing sequence arguments with consideration of the speed of propagation of messages, together with careful counting of messages in different parts of the network. They enable us to prove the following results, settling two open problems: An Ω(n log* n) lower bound for the number of messages sent by an asynchronous algorithm for computing any nonconstant function on a bidirectional ring of n anonymous processors. An Ω(n log n) lower bound for the average number of messages sent by any maximum finding algorithm on a ring of n processors, in case n is known.

Authors

• Pavol Duris
• Zvi Galil

Keywords

• Distributed computing
• Propagation delay
• Upper bound
• Processor scheduling
• Lower Bound
• N Log N
• Proof Of Theorem
• Small Segments
• Ring Size
• Distinct Labels