Abstract
We consider a ring of unknown number of anonymous processors. We restrict ourselves to algorithms that are message terminate, i.e. the algorithm terminates when no more messages are present in the system but the processors may lack the ability to detect this situation. The work addresses algorithms (both deterministic and probabilistic) that always terminate with the correct result. We show the following:
-
A deterministic algorithm for orientation that requires a symmetry breaking marking on the links and uses O(n log2 n) bits for communication and O(n) time. A Las-Vegas version of this algorithm that uses probability to break symmetry has the same average communication and time cost.
-
A deterministic algorithm for pattern searching that uses O(n · ¦S¦) communication bits for a pattern of length ¦S¦. Computing AND and OR are simple cases of that algorithm.
-
A probabilistic algorithm for dividing an even ring to pairs that uses O(n log n) communication bits and time.
-
The impossibility of computing a class of functions called nonsym-metric that includes: leader election, XOR and finding the ring size. The same technique can be applied to prove the impossibility of dividing an odd ring to a maximal number of pairs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Abrahamson, A. Adler, L. Higham, and D. Kirkpatrick. Randomized function evaluation on a ring. In J. van Leeuwen, editor, Proceedings, 2nd International Workshop on Distributed Algorithms, pages 324–331, July 1987. Lecture Notes in Computer Science, Vol. 312.
K. Abrahamson, A. Adler, L. Higham, and D. Kirkpatrick. Optimal algorithms for probabilistic solitude detection on anonymous rings. Technical report TR 90-3, University of British Columbia, 1990.
H. Attiya and M. Snir. Better computing on the anonymous ring. Journal of Algorithms, 12(2):204–238, June 1991.
H. Attiya, M. Snir, and M. K. Warmuth. Computing on the anonymous ring. Journal of the ACM, 35(4):845–875, 1988.
I. Cidon and Y. Shavitt. Message terminate algorithms for rings of unknown size. EE Pub. 793, Technion-Israel Institute of Technology, Dept. of Electrical Engineering, Haifa 32000, ISRAEL, August 1991.
D. H. Greene and D. E. Knuth. Mathematics for the Analysis of Algorithms. Birkhauser, second edition, 1982.
A. Israeli and M. Jalfon. Uniform self stabilizing ring orientation. Information and Computation, 1991. to be published.
A. Itai and M. Rodeh. Symmetry breaking in distributed networks. In Proceedings of the 22nd annual IEEE symp. of fundations of computer science (FOCS), pages 150–158, 1981.
A. Itai and M. Rodeh. Symmetry breaking in distributed networks. Information and Computation, 88(1), September 1990.
S. Moran and M. K. Warmuth. Gap theorms for distributed computation. In Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 141–150, 1986.
J. K. Pachl. A lower bound for probabilistic distributed algorithms. Journal of Algorithms, 8:53–65, 1987.
B. Schieber and M. Snir. Calling names on nameless networks. In Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 319–328, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cidon, I., Shavitt, Y. (1992). Message terminate algorithms for anonymous rings of unknown size. In: Segall, A., Zaks, S. (eds) Distributed Algorithms. WDAG 1992. Lecture Notes in Computer Science, vol 647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56188-9_18
Download citation
DOI: https://doi.org/10.1007/3-540-56188-9_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56188-0
Online ISBN: 978-3-540-47484-5
eBook Packages: Springer Book Archive