Lower Bounds for Distributed Maximum-Finding Algorithms
Journal of the ACM (JACM)
Electing a leader in a synchronous ring
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
Virtual rings: an introduction to concurrency
ACM SIGCSE Bulletin
A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems
IEEE Transactions on Computers
Design by decomposition of multiparty interactions in Raddle87
IWSSD '89 Proceedings of the 5th international workshop on Software specification and design
Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency
IEEE Transactions on Software Engineering
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A fault tolerance approach for distributed ISDN control systems
ACM SIGOPS Operating Systems Review
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
A SAT-based network access scheme for fairness in high speed networks
IEEE/ACM Transactions on Networking (TON)
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct
IEEE Transactions on Parallel and Distributed Systems
Improvements in the time complexity of two message-optimal election algorithms
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A Highly Available Local Leader Election Service
IEEE Transactions on Software Engineering
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
Parallel state space construction for model-checking
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Technical correspondence: on message passes in computer networks.
Communications of the ACM
technical correspondence: on message passes in computer networks. author's response
Communications of the ACM
A fault tolerance approach for distributed ISDN control systems
EW 4 Proceedings of the 4th workshop on ACM SIGOPS European workshop
A Resilient Mutual Exclusion Algorithm for Computer Networks
IEEE Transactions on Parallel and Distributed Systems
A UNITY-Style Programming Logic for Shared Dataspace Programs
IEEE Transactions on Parallel and Distributed Systems
Optimal Resilient Distributed Algorithms for Ring Election
IEEE Transactions on Parallel and Distributed Systems
Dynamic Synchrony Among Atomic Actions
IEEE Transactions on Parallel and Distributed Systems
On the communication complexity of strong time-optimal distributed algorithms
Nordic Journal of Computing
The Fast Bully Algorithm: For Electing a Coordinator Process in Distributed Systems
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part II
IF: An Intermediate Representation and Validation Environment for Timed Asynchronous Systems
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Finding an extremum in a network
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On the performance of decentralized software
PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
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
On the expressive power of polyadic synchronisation in π-calculus
Nordic Journal of Computing
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16
Design and analysis of dynamic leader election protocols in broadcast networks
Distributed Computing
On the complexity of computation in the presence of link failures: the case of a ring
Distributed Computing
Cost distribution of the Chang-Roberts leader election algorithm and related problems
Theoretical Computer Science
Two novel algorithms for electing coordinator in distributed systems basedon bully algorithm
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
A peer-to-peer meta-scheduler for service-oriented grid environments
Proceedings of the first international conference on Networks for grid applications
A Hierarchical Leader Election Protocol for Mobile Ad Hoc Networks
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Evolving distributed algorithms with genetic programming: election
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
SAFE: scalable autonomous fault-tolerant Ethernet
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Simplifying Itai-Rodeh Leader Election for Anonymous Rings
Electronic Notes in Theoretical Computer Science (ENTCS)
Selecting and commanding individual robots in a vision-based multi-robot system
Proceedings of the 5th ACM/IEEE international conference on Human-robot interaction
Maintaining a ring structure for mobile ad hoc computing
Journal of Parallel and Distributed Computing
Generalization of the fast consistency algorithm to a grid with multiple high demand zones
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
Kodkod: a relational model finder
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
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
Solving classic problems in distributed systems: the smart-message paradigm
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Synthesizing solutions to the leader election problem using model checking and genetic programming
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
Secure random number generation in wireless sensor networks
Proceedings of the 4th international conference on Security of information and networks
A knowledge-based analysis of global function computation
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Fair leader election by randomized voting
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
A fault-tolerant distributed scheme for grid information services
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
From clarity to efficiency for distributed algorithms
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
| Hi-index | 48.28 |
This note presents an improvement to LeLann's algorithm for finding the largest (or smallest) of a set of uniquely numbered processes arranged in a circle, in which no central controller exists and the number of processes is not known a priori. This decentralized algorithm uses a technique of selective message extinction in order to achieve an average number of message passes of order (n log n) rather than O(n2).