Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
An Efficient Sorting Algorithm on the Multi-Mesh Network
IEEE Transactions on Computers
Basic Operations on the OTIS-Mesh Optoelectronic Computer
IEEE Transactions on Parallel and Distributed Systems
Randomized Routing, Selection, and Sorting on the OTIS-Mesh
IEEE Transactions on Parallel and Distributed Systems
Image Processing on the OTIS-Mesh Optoelectronic Computer
IEEE Transactions on Parallel and Distributed Systems
Parallel sorting algorithm using multiway merge and its implementation on a multi-mesh network
Journal of Parallel and Distributed Computing
Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer
IEEE Transactions on Computers
BPC Permutations on the OTIS-Mesh Optoelectronic Computer
MPPOI '97 Proceedings of the 4th International Conference on Massively Parallel Processing Using Optical Interconnections
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Multi-mesh of trees with its parallel algorithms
Journal of Systems Architecture: the EUROMICRO Journal
Polynomial interpolation and polynomial root finding on OTIS-mesh
Parallel Computing
Parallel algorithm for conflict graph on OTIS-triangular array
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
| Hi-index | 0.00 |
The Optical Transpose Interconnection System (OTIS) based interconnection network has already gained popularity among researchers for achieving high performance computation. It has become one of the efficient models for optoelectronic parallel computers. Sorting is one of the fundamental problems and is commonly used in many scientific and engineering applications. We are motivated to develop sorting algorithm due to its popularity. In this paper, we propose a parallel algorithm for sorting N (= n2) data elements on an OTIS-Ring optoelectronic parallel computer containing N (= n2) processors. To analyze the time complexity of our proposed algorithm, we count the data movements on electronic links (electronic move) and that on optical links (OTIS move) separately. Our proposed parallel algorithm for sorting requires 0.5n(n2+3n+1) electronic moves + n(2n+0.5) OTIS moves. Thus, the ratio of number of electronic moves to OTIS move of our proposed algorithm is O(n)