Message terminate algorithms for anonymous rings of unknown size
A deterministic algorithm for orientation that requires a symmetry breaking marking on the links and uses O(n log2n) 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.
KeywordsDeterministic Algorithm Unknown Number Maximum Match Ring Size Leader Election
Unable to display preview. Download preview PDF.
- 1.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.Google Scholar
- 2.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.Google Scholar
- 3.H. Attiya and M. Snir. Better computing on the anonymous ring. Journal of Algorithms, 12(2):204–238, June 1991.Google Scholar
- 4.H. Attiya, M. Snir, and M. K. Warmuth. Computing on the anonymous ring. Journal of the ACM, 35(4):845–875, 1988.Google Scholar
- 5.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.Google Scholar
- 6.D. H. Greene and D. E. Knuth. Mathematics for the Analysis of Algorithms. Birkhauser, second edition, 1982.Google Scholar
- 7.A. Israeli and M. Jalfon. Uniform self stabilizing ring orientation. Information and Computation, 1991. to be published.Google Scholar
- 8.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.Google Scholar
- 9.A. Itai and M. Rodeh. Symmetry breaking in distributed networks. Information and Computation, 88(1), September 1990.Google Scholar
- 10.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.Google Scholar
- 11.J. K. Pachl. A lower bound for probabilistic distributed algorithms. Journal of Algorithms, 8:53–65, 1987.Google Scholar
- 12.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.Google Scholar