Sorting and election in anonymous asynchronous rings

Journal of Parallel and Distributed Computing

Volumn 64, Issue 2, 2004, Pages 254-265

  Flocchini, Paola ^a   Kranakis, Evangelos ^b   Krizanc, Danny ^c   Luccio, Flaminia L ^d   Santoro, Nicola ^b  

^a UNIVERSITY OF OTTAWA   (Canada)

^b CARLETON UNIVERSITY   (Canada)

^c WESLEYAN UNIVERSITY   (United States)

^d UNIVERSITY OF TRIESTE   (Italy)

Author keywords

Anonymous ring; Distributed computing; Leader election; Multisets; Sorting

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTER SCIENCE; DISTRIBUTED COMPUTER SYSTEMS; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; SET THEORY; TOPOLOGY;

ANONYMOUS RINGS; DISTRIBUTED COMPUTING; LEADER ELECTION; MULTISETS;

SORTING;

EID: 2942558824     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2003.11.007     Document Type: Article

References (16)

1. Alimonti P., Flocchini P., Santoro N. Finding the extrema of a distributed multiset. J. Parallel Distrib. Comput. 37(2):1996;123-133.
2. D. Angluin, Local and global properties in networks of processors, in: Proceedings of the 12th ACM Symposium on Theory of Computing, Las Angeles, CA, 1980, pp. 82-93.
3. Attiya H., Snir M. Better computing on the anonymous ring. J. Algorithms. 12(2):1991;204-238.
4. Attiya H., Snir M., Warmuth M. Computing on an anonymous ring. J. ACM. 35(4):1988;845-875.
5. Bodlaender H.L., Moran S., Warmuth M.K. The distributed bit complexity of the ring. from the anonymous to the non-anonymous case Inform. Comput. 108(1):1994;34-50.
6. P. Ferragina, A. Monti, A. Roncato, Trade-off between computation power and common knowledge in anonymous rings, in: Proceedings of the First Colloquium on Structural Information and Communication Complexity, Ottowa, Canada, 1994, pp. 35-48.
7. P. Flocchini, E. Kranakis, D. Krizanc, F.L. Luccio, N. Santoro, Sorting multisets in anonymous rings, in: Proceedings of the 14th IEEE International Parallel and Distributed Processing Symposium, Cancun, Mexico, 2000, pp. 275-280.
8. Gerstel O., Zaks S. The bit complexity of distributed sorting. Algorithmica. 18:1997;405-416.
9. Kranakis E., Krizanc D., Luccio F.L. On recognizing a string on an anonymous ring. Theory Comput. Systems. 34(1):2001;3-12.
10. Loui M.C. The complexity of sorting on distributed systems. Inform. Control. 60(1-3):1984;70-85.
11. Lynch N. Distributed Algorithms. 1996;Morgan-Kaufmann, San Mateo, CA.
12. Moran S., Warmuth M.K. Gap theorems for distributed computation. SIAM J. Comput. 22(2):1993;379-394.
13. Rotem D., Santoro N., Sidney J.B. Distributed sorting. IEEE Trans. Comput. 34(4):1985;372-376.
14. N. Sakamoto, Comparison of initial conditions for distributed algorithms on anonymous networks, in: Proceedings of the 18th Annual ACM Symposium on Distributed Computing, Atlanta, GA, USA, 1999, pp. 173-179.
15. Yamashita M., Kameda T. Computing on anonymous networks, Part I. characterizing the solvable cases IEEE Trans. Parallel Distrib. Systems. 7(1):1996;69-89.
16. Yamashita M., Kameda T. Leader election problem on networks in which processor identity numbers are not distinct. IEEE Trans. Parallel Distrib. Systems. 9(10):1999;878-887.