Parallel Graph Algorithms Based Upon Broadcast Communications
IEEE Transactions on Computers
Optimal Prioritized Conflict Resolution on a Multiple Access Channel
IEEE Transactions on Computers
Reducing conflict resolution time for solving graph problems in broadcast communications
Information Processing Letters
Maximum finding on a multiple access broadcast network
Information Processing Letters
Dynamic Prioritized Conflict Resolution on Multiple Access Broadcast Networks
IEEE Transactions on Computers
A fast maximum finding algorithm on broadcast communication
Information Processing Letters
Information Processing Letters
Distributed Sorting on Local Area Networks
IEEE Transactions on Computers
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
Finding an extremum in a network
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Broadcast Communications and Distributed Algorithms
IEEE Transactions on Computers
Tree algorithms for packet broadcast channels
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paper, we shall propose a fast algorithm to solve the sorting problem under the broadcast communication model(BCM). The key point of our sorting algorithm is to use successful broadcasts to build broadcasting layers logically and then to distribute the data elements into those logic layers properly. Thus, the number of broadcast conflicts is reduced. Suppose that there are n input data elements and n processors under BCM are available. We show that the average time complexity of our sorting algorithm is Θ(n). In addition, we expand this result to the generalized sorting, that is, finding the first k largest elements with a sorted sequence among n elements. The analysis of the generalization builds a connection between the two special cases which are maximum finding and sorting. We prove that the average time complexity for finding the first k largest numbers is Θ(k + log (n - k)).