Abstract

This chapter considers message passing systems whose topology is a ring and studies the leader election problem in both synchronous and asynchronous systems. The problem is shown to be impossible to solve in anonymous rings. Tight bounds on message complexity are given for synchronous and asynchronous cases.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call