SIAM Journal on Computing
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Efficient and scalable quicksort on a linear array with a reconfigurable pipelined bus system
Future Generation Computer Systems
Optimally scaling permutation routing on reconfigurable linear arrays with optical buses
Journal of Parallel and Distributed Computing
Parallel Computing Using Optical Interconnections
Parallel Computing Using Optical Interconnections
Fast Sorting Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System
IEEE Transactions on Parallel and Distributed Systems
Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical Bus
IEEE Transactions on Computers
An Optimal Parallel Algorithm for Computing Moments on Arrays with Reconfigurable Optical Buses
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Relating Two-Dimensional Reconfigurable Meshes with Optically Pipelined Buses
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
(C) Integer Sorting and Routing in Arrays with Reconfigurable Optical Buses
ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 2
| Hi-index | 0.00 |
In this paper, we present an efficient deterministic algorithm for sorting on the LARPBS (Linear Array with a Reconfigurable Pipelined Optical Bus System) model. Our sorting algorithm sorts n general keys in O(logn) time on a LARPBS of size nßlogn. The previous best results can sort n items in O(lognloglogn) worst-case time using n processors or sort n items in O((log logn2)worst-case time using n1+ processors. Our algorithm is also scalable to certain extent. When the system size is reduced to nßlogn/r for l≤r≤logn, the total computation time is O(rlogn).