On the bit complexity of distributed computations in a ring with a leader
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
A Probabilistic Pipeline Algorithm for K Selection on the Tree Machine
IEEE Transactions on Computers
Reduction Techniques for Selection in Distributed Files
IEEE Transactions on Computers
A trade-off between information and communication in broadcast protocols
Journal of the ACM (JACM)
Efficient Distributed Selection with Bounded Messages
IEEE Transactions on Parallel and Distributed Systems
Distributed Sorting on Local Area Networks
IEEE Transactions on Computers
Designing Efficient Distributed Algorithms Using Sampling Techniques
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Tight bounds for distributed selection
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Distributed selection: a missing piece of data aggregation
Communications of the ACM - Enterprise information integration: and other tools for merging data
| Hi-index | 0.01 |
Algorithms are presented for selecting an element of given rank from a set of elements distributed among the nodes of a network. Network topologies considered are a ring, a mesh, and a complete binary tree. For the ring and the mesh, upper bound tradeoffs are identified between the number of messages transmitted and the total delay due to message transmission. For the tree, an algorithm is presented that uses an asymptotically optimal number of messages.