The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
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
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Content Addressable Parallel Processors
Content Addressable Parallel Processors
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Simple, efficient, asynchronous parallel algorithms for maximization
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel Graph Algorithms Based Upon Broadcast Communications
IEEE Transactions on Computers
Optimal Prioritized Conflict Resolution on a Multiple Access Channel
IEEE Transactions on Computers
Dynamic Prioritized Conflict Resolution on Multiple Access Broadcast Networks
IEEE Transactions on Computers
Simple, efficient asynchronous parallel algorithms for maximization
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Broadcast-Efficient Protocols for Mobile Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Solving An Algebraic Path Problem and Some Related Graph Problems on a Hyper-Bus Broadcast Network
IEEE Transactions on Parallel and Distributed Systems
An Optimal Multiple Bus Network for Fan-in Algorithms
ICPP '97 Proceedings of the international Conference on Parallel Processing
A Fast Sorting Algorithm and Its Generalization on Broadcast Communications
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Broadcast Communications and Distributed Algorithms
IEEE Transactions on Computers
Communication and energy efficient routing protocols for single-hop radio networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.01 |
We propose a method for implementing “the election process” - finding an extrema of values computed in a multiprocessor network. It operates in an average time less than Log2(N), for a network of size N. It requires a single register, memory cell, or global buss into which all the processors can attempt to write, with the success of one guaranteed; and from which they may all read, in parallel. A second method is given which guarantees termination in O(Log2(MAX)) steps.