Two-bounce optical arbitrary permutation network.

The two-bounce free-space arbitrary interconnection architecture is presented. It results from a series of three-dimensional topological transformations to the Benes network, the minimum rearrangeable nonblocking network. Although functionally equivalent to the Benes network, it requires only two stages of global (spanning multiple chips) optical interconnections. The remaining stages of the modified Benes interconnection network are local and are implemented electronically (on individual chips). The two-bounce network is optimal in the sense that it retains the Benes minimum number of electronic switching resources yet also minimizes the number of optical links needed for global interconnection. Despite the use of higher-order k-shuffle (k > 2) global optical interconnects, the number of 2 x 2 switching elements is identical to the two-shuffle Benes network: there is no need for k x k crossbar switches for local interconnection at each stage. An experimental validation of the two-bounce architecture is presented.

[1]  M W Haney,et al.  Sliding-banyan network performance analysis. , 1997, Applied optics.

[2]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[3]  M W Haney.  Pipelined optoelectronic free-space permutation network. , 1992, Optics letters.

[4]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

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

[6]  Michael W. Haney,et al.  Two-bounce free-space arbitrary interconnection architecture , 1997, Proceedings of the Fourth International Conference on Massively Parallel Processing Using Optical Interconnections.

[7]  R A Athale,et al.  Folded perfect shuffle optical processor. , 1988, Applied optics.

[8]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[9]  Richard G. Rozier,et al.  FAST-Net optical interconnection prototype demonstration program , 1998, Photonics West.

[10]  Michael W. Haney,et al.  Fundamental geometric advantages of free-space optical interconnects , 1996, Proceedings of Massively Parallel Processing Using Optical Interconnections.

[11]  Marc Snir,et al.  The Performance of Multistage Interconnection Networks for Multiprocessors , 1983, IEEE Transactions on Computers.

[12]  Thomas F. Krile,et al.  2-D Optical Multistage Interconnection Networks , 1987, Photonics West - Lasers and Applications in Science and Engineering.

[13]  M W Haney,et al.  Performance scaling comparison for free-space optical and electrical interconnection approaches. , 1998, Applied optics.

[14]  A. A. Sawchuk,et al.  Geometries For Optical Implementations Of The Perfect Shuffle , 1989, Other Conferences.

[15]  Y Li,et al.  Compact optical generalized perfect shuffle. , 1987, Applied optics.

[16]  Michael W. Haney,et al.  Experimental evaluation of the 3-D optical shuffle interconnection module of the sliding Banyan architecture , 1996 .

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

[18]  A. Lohmann.  What classical optics can do for the digital optical computer. , 1986, Applied optics.

[19]  Michael W. Haney,et al.  Sliding Banyan network , 1996 .

[20]  D Chariot,et al.  Ellipsometric data processing: an efficient method and an analysis of the relative errors; erratum. , 1987, Applied optics.

[21]  M W Haney.  Self-similar grid patterns in free-space shuffle - exchange networks. , 1993, Optics letters.

[22]  K H Brenner,et al.  Optical implementations of the perfect shuffle interconnection. , 1988, Applied optics.