Electing a leader in a ring with link failures
Acta Informatica
Computing on an anonymous ring
Journal of the ACM (JACM)
Data link layer: two impossibility results
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
On an improved algorithm for decentralized extrema finding in circular configurations of processors
Communications of the ACM
Decentralized extrema-finding in circular configurations of processors
Communications of the ACM
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
Elections in the presence of faults
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Efficient and reliable broadcast is achievable in an eventually connected network(Extended Abstract)
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
The impact of synchronous communication on the problem of electing a leader in a ring
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Distributed elections in an archimedean ring of processors
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Optimal Allocation for Partially Replicated Database Systems on Ring Networks
IEEE Transactions on Knowledge and Data Engineering
Mobile Search for a Black Hole in an Anonymous Ring
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
| Hi-index | 0.00 |
We investigate the message complexity of distributed computations on rings of asynchronous processors. In such computations, each processor has an initial local value and the task is to compute some predetermined function of all local values. Our work deviates from previous works concerning the complexity of ring computations in that we consider the effect of link failures. A link is said to fail if some message sent through it never reaches its destination. We show that the message complexity of any function, which is "sensitive to all its inputs", is Θ(n log n) when n, the number of processors, is a-priori known; and is Θ(n2) when n is not known. Interestingly, these tight bounds do not depend on whether the identity of a leader is a-priori known before the computation starts. These results stand in sharp contrast to the situation in asynchronous rings with no link failures, where the message complexity is affected by the a-priori knowledge of a leader but is not affected by the knowledge of n.