An optimal sorting algorithm for mesh connected computers
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Some parallel sorts on a mesh-connected processor array and their time efficiency
Journal of Parallel and Distributed Computing
Array processor with multiple broadcasting
Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
On multidimensional packet routing for meshes with buses
Journal of Parallel and Distributed Computing
Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing and Sorting
IEEE Transactions on Computers
Complexity of Sub-Bus Mesh Computations
SIAM Journal on Computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Optimal one-way sorting on a one-dimensional sub-bus array
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A sorting algorithm on a PC cluster
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
| Hi-index | 14.98 |
We consider the problem of sorting on a one-dimensional subbus array of processors, an architecture that communicates using a segmentable bus. The subbus broadcast operation makes possible a new class of parallel sorting algorithms whose complexity we analyze with the parallel insertion model. We give per-input lower bounds for sorting in the parallel insertion model and demonstrate sorting strategies that are optimal by matching those lower bounds. For each of our sorting strategies, we discuss the issues involved in implementing them on subbus machines. Finally, we empirically evaluate the performance of our sorting strategies by applying them to shearsort, a common two-dimensional mesh sorting algorithm. Our results suggest that for sorting the subbus broadcast capability gives at most a slight advantage over using only nearest neighbor communication.