SIAM Journal on Computing
Pipelined communications in optically interconnected arrays
Journal of Parallel and Distributed Computing
The Journal of Supercomputing - Special issue: high performance computing systems
Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Solving Graph Theory Problems Using Reconfigurable Pipelined Optical Buses
Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
Fast Parallel Selection on the Linear Array with Reconfigurable Pipelined Bus System
FRONTIERS '99 Proceedings of the The 7th Symposium on the Frontiers of Massively Parallel Computation
Efficient Graph-Theoretic Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System
The Journal of Supercomputing
Journal of Parallel and Distributed Computing
Multiple Addition and Prefix Sum on a Linear Array with a Reconfigurable Pipelined Bus System
The Journal of Supercomputing
Optimal fault-tolerant embedding of paths in twisted cubes
Journal of Parallel and Distributed Computing
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
IEEE Transactions on Parallel and Distributed Systems
An efficient O(1) time 3D all nearest neighbor algorithm from image processing perspective
Journal of Parallel and Distributed Computing
Edge-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences: an International Journal
Path embeddings in faulty 3-ary n-cubes
Information Sciences: an International Journal
Computers and Electrical Engineering
Faster sorting on a linear array with a reconfigurable pipelined bus system
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
Discrete Applied Mathematics
| Hi-index | 0.01 |
We present two fast algorithms for sorting on a linear array with a reconfigurable pipelined bus system (LARPBS), one of the recently proposed parallel architectures based on optical buses. In our first algorithm, we sort N numbers in O(\log N\log\log N)worst-case time using N processors. In our second algorithm, we sort N numbers in O(\log\log N)^2) worst-case time using N^{1+\epsilon} processors, for any fixed \epsilon such that 0\epsilon1. Our algorithms are based on a novel deterministic sampling scheme for merging two sorted arrays of length N each in O(\log\log N) time on an LARPBS with N processors. To our knowledge, the previous best sorting algorithm on this architecture has a running time of O(\log N)^{2}) using N processors.