SIAM Journal on Computing
Pipelined communications in optically interconnected arrays
Journal of Parallel and Distributed Computing
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses
IEEE Transactions on Parallel and Distributed Systems
The Journal of Supercomputing - Special issue: high performance computing systems
IEEE Transactions on Parallel and Distributed Systems
Linear array with a reconfigurable pipelined bus system—concepts and applications
Information Sciences: an International Journal - special issue on parallel and distributed processing
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
More Efficient Topological Sort Using Reconfigurable Optical Buses
The Journal of Supercomputing
IEEE Transactions on Parallel and Distributed 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
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System
ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
Models and Algorithms for Optical and Optoelectronic Parallel Computers
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Scalable and Efficient Parallel Algorithms for Euclidean Distance Transform on the LARPBS Model
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
A Parameterized Linear Array with a Reconfigurable Pipelined Bus System: LARPBS(p)
The Computer Journal
Bus-Based Tree Structures for Efficient Parallel Computation
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
An efficient O(1) time 3D all nearest neighbor algorithm from image processing perspective
Journal of Parallel and Distributed Computing
An Efficient Parallel Algorithm for the Longest Increasing Subsequence Problem on a LARPBS
PDCAT '07 Proceedings of the Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies
Repetitions detection on a linear array with reconfigurable pipelined bus system
International Journal of Parallel, Emergent and Distributed Systems
An efficient sequence alignment algorithm on a LARPBS
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Fast sequence similarity computing with LCS on LARPBS
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Bitonic sort on a chained-cubic tree interconnection network
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Optical interconnections attract many engineers and scientists' attention due to their potential for gigahertz transfer rates and concurrent access to the bus in a pipelined fashion. These unique characteristics of optical interconnections give us the opportunity to reconsider traditional algorithms designed for ideal parallel computing models, such as PRAMs. Since the PRAM model is far from practice, not all algorithms designed on this model can be implemented on a realistic parallel computing system. From this point of view, we study Cole's pipelined merge sort [Cole R. Parallel merge sort. SIAM J Comput 1988;14:770-85] on the CREW PRAM and extend it in an innovative way to an optical interconnection model, the LARPBS (Linear Array with Reconfigurable Pipelined Bus System) model [Pan Y, Li K. Linear array with a reconfigurable pipelined bus system-concepts and applications. J Inform Sci 1998;106;237-58]. Although Cole's algorithm is optimal, communication details have not been provided due to the fact that it is designed for a PRAM. We close this gap in our sorting algorithm on the LARPBS model and obtain an O(logN)-time optimal sorting algorithm using O(N) processors. This is a substantial improvement over the previous best sorting algorithm on the LARPBS model that runs in O(logNloglogN) worst-case time using N processors [Datta A, Soundaralakshmi S, Owens R. Fast sorting algorithms on a linear array with a reconfigurable pipelined bus system. IEEE Trans Parallel Distribut Syst 2002;13(3):212-22]. Our solution allows efficiently assign and reuse processors. We also discover two new properties of Cole's sorting algorithm that are presented as lemmas in this paper.