A computer and communications network performance analysis primer
A computer and communications network performance analysis primer
A taxonomy of parallel sorting
ACM Computing Surveys (CSUR)
Sorting on a mesh-connected parallel computer
Communications of the ACM
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract)
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Finding an extremum in a network
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Bounds on the time for parallel RAM's to compute simple functions
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Routing, merging and sorting on parallel models of computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On the time complexity of broadcast communication schemes (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Optimal Sorting Algorithms for Parallel Computers
IEEE Transactions on Computers
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
IEEE Transactions on Computers
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
An optimal parallel perceptron learning algorithm for a large training set
Parallel Computing
An Optimal Multiple Bus Network for Fan-in Algorithms
ICPP '97 Proceedings of the international Conference on Parallel Processing
Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
A Fast Sorting Algorithm and Its Generalization on Broadcast Communications
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Broadcast-Efficient Algorithms on the Coarse-Grain Broadcast Communication Model with Few Channels
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
A fault-tolerant permutation routing algorithm in mobile ad-hoc networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
| Hi-index | 14.98 |
The paper addresses ways in which one can use "broadcast communication" in distributed algorithms and the relevant issues of design and complexity. We present an algorithm for merging k sorted lists of n/k elements using k processors and prove its worst case complexity to be 2n, regardless of the number of processors, while neglecting the cost arising from possible conflicts on the broadcast channel. We also show that this algorithm is optimal under single-channel broadcast communication. In a variation of the algorithm, we show that by using an extra local memory of O(k) the number of broadcasts is reduced to n. When the algorithm is used for sorting n elements with k processors, where each processor sorts its own list first and then merging, it has a complexity of O(n/k log(n/k) + n), and is thus asymptotically optimal for large n. We also discuss the cost incurred by the channel access scheme and prove that resolving conflicts whenever k processors are involved introduces a cost factor of at least log k.