Leader election in rings with nonunique labels

Fundamenta Informaticae

Volumn 59, Issue 4, 2004, Pages 333-347

  Dobrev, Stefan ^a   Pelc, Andrzej ^b  

^a UNIVERSITY OF OTTAWA   (Canada)

^b UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

Distributed algorithms; Leader election; Ring network

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; MATHEMATICAL OPERATORS; SET THEORY; THEOREM PROVING;

DISTRIBUTED ALGORITHMS; LEADER ELECTION; MESSAGE COMPLEXITY; RING NETWORKS;

PROBLEM SOLVING;

EID: 2342551132     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. H. Attiya, M. Snir and M. Warmuth, Computing on an Anonymous Ring, Journal of the ACM 35, (1988), 845-875.
2. H. Attiya and M. Snir, Better Computing on the Anonymous Ring, Journal of Algorithms 12, (1991), 204-238.
3. P. Boldi and S. Vigna, Computing anonymously with arbitrary knowledge, Proc. 18th ACM Symp. on Principles of Distributed Computing, 1999.
4. J.E. Burns, A formal model for message passing systems, Tech. Report TR-91, Computer Science Department, Indiana University, Bloomington, September 1980.
5. K. Diks, E. Kranakis A. Malinowski and A. Pelc, Anonymous wireless rings, Theoretical Computer Science 145 (1995), 95-109.
6. P. Flocchini, E. Kranakis, D. Krizanc, F.L. Luccio and N. Santoro, Sorting Multisets in Anonymous Rings, Proc. of the IEEE International Parallel and Distributed Processing Symposium (IPDPS 2000), Cancun, Mexico, (2000), 275-280.
7. Franklin, W. R.: On an Improved Algorithm for Decentralised Extrema Finding in Circular Configurations of Processors. Comm. of ACM 25(5) (1982), 336-337.
8. G.N. Fredrickson and N.A. Lynch, Electing a leader in a synchronous ring, Journal of the ACM 34 (1987), 98-115.
9. D.S. Hirschberg, and J.B. Sinclair, Decentralized extrema-finding in circular configurations of processes, Communications of the ACM 23 (1980), 627-628.
10. E. Kranakis, Symmetry and Computability in Anonymous Networks: A Brief Survey, Proc. 3rd Int. Conf. on Structural Information and Communication Complexity, 1997, 1-16.
11. E. Kranakis, D. Krizanc and J. van der Berg, Computing Boolean Functions on Anonymous Networks, Information and Computation 114, (1994), 214-236.
12. N.L. Lynch, Distributed algorithms, Morgan Kaufmann Publ. Inc., San Francisco, USA, 1996.
13. G.L. Peterson, An O(n log n) unidirectional distributed algorithm for the circular extrema problem, ACM Transactions on Programming Languages and Systems 4 (1982), 758-762.
14. N. Sakamoto, Comparison of Initial Conditions for Distributed Algorithms on Anonymous Networks, Proc. 18th ACM Symp. on Principles of Distributed Computing, 1999, 173-179.
15. M. Yamashita and T. Kameda, Computing on anonymous networks, Proc. 7th ACM Symp. on Principles of Distributed Computing, 1988, 117-130.
16. M. Yamashita and T. Kameda, Electing a leader when procesor identity numbers are not distinct, Proc. 3rd Workshop on Distributed Algorithms, LNCS Vol 392, Springer-Verlag, 1989.
17. M. Yamashita and T. Kameda, Computing on anonymous networks: Part I - characterizing the solvable cases, IEEE Trans. Parallel and Distributed Systems, 7 (1996), 69-89.