BPC Permutations on the OTIS-Hypercube Optoelectronic Computer

We show that the diameter of an N 2 processor OTIS-Hypercube computer (N = 2 d) is 2d + 1. OTIS-Hypercube algorithms for some commonly performed permutations { transpose, bit reversal, vector reversal, perfect shuue, unshuue, shuued row-major, and bit shuue { are developed. We also propose an algorithm for general BPC permutations.

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

[2]  Ramamohan Paturi,et al.  Scalable Network Architectures Using the Optical Transpose Interconnection System (OTIS) , 2000, J. Parallel Distributed Comput..

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

[4]  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.

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

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