Coordinated computing: tools and techniques for distributed software
Coordinated computing: tools and techniques for distributed software
Lower Bounds for Distributed Maximum-Finding Algorithms
Journal of the ACM (JACM)
The effects of link failures on computations in asynchronous rings
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Local area networks: architectures and implementations
Local area networks: architectures and implementations
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
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
Assertion-based proof checking of chang-roberts leader election in PVS
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
| Hi-index | 0.00 |
The problem of electing a leader in a dynamic ring in which processors are permitted tofail and recover during election is discussed. It is shown that theta (n log n+k/sub r/)messages, counting only messages sent by functional processors, are necessary andsufficient for dynamic ring election, where k/sub r/ is the number of processor recoveriesexperienced.