16
Views
5
CrossRef citations to date
0
Altmetric
Original Articles

Distributed election in a circle without a global sense of orientation

, &
Pages 115-124 | Received 01 Dec 1983, Published online: 19 Mar 2007
 

Abstract

The election problem in a circle of n processors has been studied either assuming bidrectional message‐passing but no global sense of orientation, or assuming a global sense of orientation but unidirectional message‐passing. To date, no complexity relationship is known between these two cases except that, in both, the worst-case message complexity is ω(nlogn). In this paper we continue the investigation of the bidirectional case with no global sense of orientation and present an algorithm which requires in the worst case 1.89 n logm+0(n) messages, where m is the number of processors which independently starts the algorithm; since n≥m, this result improves the previous 2nlog n + 0(n) upper‐bound for this case.

C.R. Categories::

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.