Elsevier

Journal of Algorithms

Volume 12, Issue 2, June 1991, Pages 204-238
Journal of Algorithms

Better computing on the anonymous ring

https://doi.org/10.1016/0196-6774(91)90002-GGet rights and content

Abstract

We consider a bidirectional ring of n processors, where processors are anonymous, i.e., are indistinguishable. In this model it is known that “most” functions (in particular XOR and orientation) have worst case message complexity Θ(n2) for asynchronous computations, and Θ(n log n) for synchronous computations. The average case behavior is different; an algorithm that computes XOR asynchronously with O(nn messages on the average is known. In this paper we give tight bounds on the average complexity of various problems. We show the following:

  • •An asynchronous deterministic algorithm that computes any computable function with O(n log n) messages, on the average (improving the O(nn algorithm). A matching lower bound is proven for functions such as XOR and orientation.

  • •An asynchronous probabilistic algorithm that computes any computable function with O(n log n) expected messages on any input, using one random bit per processor. A matching lower bound is proven.

  • •A Monte-Carlo asynchronous algorithm that computes any computable function with O(n) expected messages on any input, using one random bit per processor, with fixed error probability ε > 0.

  • •A synchronous algorithm that computes any computable function optimally in O(n) messages, on the average.

  • •A synchronous probabilistic algorithm that computes any computable function optimally in O(n) expected messages on any input, using one random bit per processor

  • •Lower bounds on the complexity of Monte-Carlo algorithms that always terminate.

References (20)

There are more references available in the full text version of this article.

Cited by (50)

  • Topology recognition and leader election in colored networks

    2016, Theoretical Computer Science
    Citation Excerpt :

    This justifies the use of this assumption in our algorithms. Many authors [1,3,4,8,17,30,31,39,41,43] studied leader election and other computational problems in anonymous networks. In particular, [7,43] characterize message passing networks in which leader election can be achieved when nodes are anonymous.

  • Four shades of deterministic leader election in anonymous networks

    2021, Annual ACM Symposium on Parallelism in Algorithms and Architectures
View all citing articles on Scopus

A preliminary version of this paper appeared in “Proceedings, 3rd Aegean Workshop on Computing, Corfu, Greece, June/July 1988” (J. Reif, Ed.), pp. 329–338, Lecture Notes in Computer Science, Vol. 319, Springer-Verlag, New York/Berlin.

Supported by ONR Contract No. N0014-85-K-0168, by NSF Contract No. CCR-8611442, and by DARPA Contract No. N00014-83-K-0125. Part of this work was done while this author was at the Department of Computer Science, Tel-Aviv University, Israel.

View full text