New protocols for the election of a leader in a ring
In this paper we investigate the impact of time for the election of a leader in a distributed environment. We propose a new protocol schema that can be specialized to obtain several protocols with different communication-time characteristics when the network is ring shaped and the communications between processors are synchronous.
Unable to display preview. Download preview PDF.
- (A).D.Angluin, "Local and Global Properties in Network of Processors" Proceedings of the 12th Annual Symposium on Theory of Computing (1980).Google Scholar
- (B).J.E.Burns, "A formal model for message passing systems, TR91", Indiana University (September 1980).Google Scholar
- (DKR).D.Dolev, M.Klawe, M.Rodeh, "An O(n log n) unidirectional distributed algorithm for extrema finding in a circle" J.Algorithms 3,3 (1982).Google Scholar
- (FL).G.Frederickson, N.Lynch, "The impact of synchronous communication on the problem of electing a leader in a ring", Proceedings of the 16th Annual ACM Symposium on Theory of Computing (1984).Google Scholar
- (G).E.Gafni, "Imprvements in the timme complexity of two message-optimal election algorithms", Proceedings of the 4th ACM Symposium on Principles of Distributed Computing (1985).Google Scholar
- (HS).D.S.Hirschberg, J.B.Sinclair, "Decentralized extremafinding in circular configurations of processes, Communications ACM 23, (1980).Google Scholar
- (P).G.L.Peterson, "An O(n log n) Unidirectional algorithm for the circular extrema problem", Trans.Prog. Lang.Sys. 4,4, (1982).Google Scholar
- (V).P.Vitanyi, "Distributed elections in archimedean ring of processors", Proceedings of the 16th Annual ACM Symposium on Theory of Computing, (1984).Google Scholar