The complexity of sorting on distributed systems
Information and Control
Ordering subscribers on cable networks
ACM Transactions on Computer Systems (TOCS)
Tradeoffs for selection in distributed networks (Preliminary Version)
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Parallel Graph Algorithms Based Upon Broadcast Communications
IEEE Transactions on Computers
Broadcast-Efficient Protocols for Mobile Radio Networks
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
Duplicate removal on Hypercube engines: An experimental analysis
Parallel Computing
| Hi-index | 14.99 |
A straight-line-topology local area network (LAN) to which a number of nodes are connected either in series or in parallel is considered. A file F is arbitrarily partitioned among these sites. The problem studied is that of rearranging the records of the file such that the keys of records at lower-ranking sites are all smaller than those at higher-ranking sites. Lower bounds on the worst-case communication complexity are given for both the series and parallel arrangements, and algorithms optimal for all networks and files are presented.