Parallel Enumeration Sort on OTIS-Hypercube

OTIS (optical transpose interconnection system), as a model of optoelectronic parallel computers, has gained tremendous popularity and is widely accepted among researchers. A rich literature on various parallel algorithms proposed for different OTIS models is available. In this paper, we propose a parallel algorithm for enumeration sort on N-processor OTIS-Hypercube architecture. The first algorithm Sort1 is for sparse enumeration sort of \(\sqrt{N}\) data elements. Algorithm Sort2, the second algorithm, is for sorting N data elements on the same architecture. Here, the time complexity of the algorithms are analyzed by the number of data movements required on the electronic links and optical links. The data movements required through electronic link and that required through optical link are expressed as electronic moves and optical moves respectively. The first proposed algorithm, Sort1, requires 4log \(\sqrt N\) electronic moves and 3 OTIS moves. Sort2, the second algorithm requires \(\sqrt{N}+(N+10\sqrt N)\)log \(\sqrt{N}\) electronic moves and \(3\sqrt{N}\) OTIS moves.

[1]  Pierre Fraigniaud,et al.  Finding the roots of a polynomial on an MIMD multicomputer , 1990, Parallel Comput..

[2]  P. Marchand,et al.  Grain-size considerations for optoelectronic multistage interconnection networks. , 1992, Applied optics.

[3]  Sartaj Sahni,et al.  Randomized Routing, Selection, and Sorting on the OTIS-Mesh , 1998, IEEE Trans. Parallel Distributed Syst..

[4]  Leslie G. Valiant,et al.  A logarithmic time sort for linear size networks , 1982, STOC.

[5]  Adi Shamir,et al.  An optimal sorting algorithm for mesh connected computers , 1986, STOC '86.

[6]  Prasanta K. Jana,et al.  Polynomial interpolation and polynomial root finding on OTIS-mesh , 2006, Parallel Comput..

[7]  Prasanta K. Jana,et al.  An Efficient Parallel Sorting Algorithm on OTIS Mesh of Trees , 2009, 2009 IEEE International Advance Computing Conference.

[8]  Sartaj Sahni,et al.  Image Processing on the OTIS-Mesh Optoelectronic Computer , 2000, IEEE Trans. Parallel Distributed Syst..

[9]  Yaagoub Ashir,et al.  Lee Distance and Topological Properties of k-ary n-cubes , 1995, IEEE Trans. Computers.

[10]  Sartaj Sahni,et al.  Optimal BPC Permutations on a Cube Connected SIMD Computer , 1982, IEEE Transactions on Computers.

[11]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[12]  S H Lee,et al.  Comparison between optical and electrical interconnects based on power and speed considerations. , 1988, Applied optics.

[13]  Bhabani P. Sinha,et al.  An Efficient Sorting Algorithm on the Multi-Mesh Network , 1997, IEEE Trans. Computers.

[14]  Khaled Day,et al.  Optical transpose k-ary n-cube networks , 2004, J. Syst. Archit..

[15]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[16]  Sartaj Sahni,et al.  Algorithms for the otis optoelectronic computer , 1998 .

[17]  S C Esener,et al.  Optical transpose interconnection system architectures. , 1993, Optics letters.

[18]  Bhabani P. Sinha,et al.  Parallel Sorting Algorithm Using Multiway Merge and Its Implementation on a Multi-Mesh Network , 2000, J. Parallel Distributed Comput..

[19]  Ramamohan Paturi,et al.  Scalable network architectures using the optical transpose interconnection system (OTIS) , 1996, Proceedings of Massively Parallel Processing Using Optical Interconnections.

[20]  Sanguthevar Rajasekaran,et al.  Randomized Sorting On The Pops Network , 2004, Int. J. Found. Comput. Sci..

[21]  Prasanta K. Jana,et al.  An Improved Parallel Prefix Algorithm on Otis-mesh , 2006, Parallel Process. Lett..

[22]  Marcos K. Aguilera,et al.  Distributed Computing and Networking , 2011, Lecture Notes in Computer Science.

[23]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[24]  Prasanta K. Jana,et al.  Parallel Algorithm for Conflict Graph on OTIS-Triangular Array , 2008, ICDCN.

[25]  Sartaj Sahni,et al.  BPC Permutations on the OTIS-Hypercube Optoelectronic Computer , 1998, Informatica.

[26]  Sartaj Sahni,et al.  BPC permutations on the OTIS-Mesh optoelectronic computer , 1997, Proceedings of the Fourth International Conference on Massively Parallel Processing Using Optical Interconnections.

[27]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1977, CACM.

[28]  Sartaj Sahni,et al.  Parallel permutation and sorting algorithms and a new generalized connection network , 1982, JACM.

[29]  Sartaj Sahni,et al.  Otis Optoelectronic Computers , 1998 .

[30]  Ashok V. Krishnamoorthy,et al.  Performance comparison between optoelectronic and VLSI multistage interconnection networks , 1991 .

[31]  Subir Bandyopadhyay,et al.  OMULT: An Optical Interconnection System for Parallel Computing , 2004, Euro-Par.

[32]  Abdel Elah Al-Ayyoub,et al.  Topological Properties of OTIS-Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[33]  S. F. Nugent,et al.  The iPSC/2 direct-connect communications technology , 1988, C3P.

[34]  Keny T. Lucas.  Parallel algorithm for sorting on OTIS-ring multicomputer , 2009, COMPUTE '09.

[35]  Selim G. Akl,et al.  Parallel Sorting Algorithms , 1985 .

[36]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1985, IEEE Trans. Computers.

[37]  Andre Osterloh,et al.  Sorting on the OTIS-mesh , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[38]  Sartaj Sahni,et al.  Basic Operations on the OTIS-Mesh Optoelectronic Computer , 1998, IEEE Trans. Parallel Distributed Syst..

[39]  Sartaj Sahni,et al.  Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer , 2001, IEEE Trans. Computers.

[40]  Keny T. Lucas.  The Gossiping on OTIS-Hypercube Optoelectronic Parallel Computer , 2007, PDPTA.