Abstract
An asynchronous distributed algorithm for finding a consistent orientation in a ring of anonymous processes is described and analyzed. In rings of size N, when the orientation of each process is chosen at random independently of other processes, the algorithm sends O(N 3/2) messages on average.
(Preliminary Version)
Research supported by the Natural Sciences and Engineering Research Council of Canada
Preview
Unable to display preview. Download preview PDF.
References
C. Attiya, M. Snir, and M. Warmuth, Computing on an Anonymous Ring, Technical Report UCSC-CRL-85-3, Computer Research Lab, Department of Computer Science. University of California, Santa Cruz, November 1, 1985.
N. Dershowitz and S. Zaks, The Cycle Lemma and Some Applications, Technical Report 238, Department of Computer Science, Technion, 1982. To appear in European J. of Combinatorics.
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.
A. Dvoretzky and Th. Motzkin, A Problem of Arrangements, Duke Math. J. 14 (1947), 305–313.
H.W. Gould, Combinatorial Identities, Morgantown, West Virginia, Morgantown Printing and Binding Company, 1972.
J. van Leeuwen and R.B. Tan, An Improved Upper Bound for Distributed Election in Bidirectional Rings of Processors, Research Report RUU-CS-85-23, Department of Computer Science, University of Utrecht, August 1985. To appear in Distributed Computing.
S. Moran, M. Shalom and S. Zaks, A 1.44 ... N log N Algorithm for Distributed Leader Finding in Bidirectional Rings of Processors, Technical Report 389, Department of Computer Science, Technion, November 1985. To appear in Acta Informatica.
N. Santoro, Sense of Direction, Topological Awareness and Communication Complexity, ACM SIGACT News (Summer 1984), 50–56.
V. Syrotiuk and J. Pachl, Average Complexity of a Distributed Orientation Algorithm, Research Report CS-87-23, Department of Computer Science, University of Waterloo, March 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Syrotiuk, V., Pachl, J. (1988). A distributed ring orientation algorithm. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019813
Download citation
DOI: https://doi.org/10.1007/BFb0019813
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19366-1
Online ISBN: 978-3-540-39239-2
eBook Packages: Springer Book Archive