A simple, efficient algorithm for maximum finding on rings

Information Processing Letters

Volumn 58, Issue 6, 1996, Pages 319-324

  Higham, Lisa ^a   Przytycka, Teresa ^b  

^a UNIVERSITY OF CALGARY   (Canada)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

Asynchronous rings; Distributed algorithms; Maximum finding; Message complexity

Indexed keywords

EID: 30244534044     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00069-5     Document Type: Article

References (8)

1. H.L. Bodlaender, Some lower bound results for decentralized extrema-finding in rings of processors, J. Comput. System Sci. 42 (1991) 97-118.
2. E. Chang and R. Roberts, An improved algorithm for decentralized extrema-finding in circular configurations of processes, Comm. ACM 22 (1979) 281-283.
3. D. Dolev, M. Klawe and M. Rodeh, An O(n log n) unidirectional distributed algorithm for extrema finding in a circle, J. Algorithms 3 (1982) 245-260.
4. L. Higham and T. Przytycka, A simple, efficient algorithm for maximum finding on rings, Tech. Rept. 92/494/32, University of Calgary, 1992.
5. D. Hirschberg and J.B. Sinclair, Decentralized extrema-finding in circular configurations of processes, Comm. ACM 23 (1980) 627-628.
6. G. LeLann, Distributed systems - towards a formal approach, in: Information Processing 77 (Elsevier, New York, 1977) 155-160.
7. J. Pachl, E. Korach and D. Rotem, Lower bounds for distributed maximum finding, J. ACM 31 (1984) 905-918.
8. G. Peterson, An O(n log n) algorithm for the circular extrema problem, ACM Trans. Programming Languages Systems 4 (1982) 758-762.