Optimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks

All-to-all personalized exchange is one of the most dense collective communication patterns and it occurs in many important parallel computing/networking applications. In this paper, we look into the issue of realizing an all-to-all personalized exchange in a class of optical multistage networks. Advances in electrooptic technologies have made optical communication a promising networking choice to meet the increasing demands for high channel bandwidth and low communication latency of high-performance computing/communication applications. Although optical multistage networks hold great promise and have demonstrated advantages over their electronic counterpart, they also hold their own challenges. Due to the unique properties of optics, crosstalk in optical switches should be avoided to make them work properly. In this paper, we provide a systematic scheme for realizing an all-to-all personalized exchange in a class of unique-path optical multistage networks crosstalk-free. The basic idea of realizing an all-to-all personalized exchange in such a multistage network is to transform it to multiple semipermutations and ensure that each of them can be realized crosstalk-free in a single pass. As can be seen, the all-to-all personalized exchange algorithm we propose has O(n) time complexity for n processors, which is optimal for an all-to-all personalized exchange. The optimal time complexity combined with the property of a single input/output port per processor suggests that a multistage network could be a better choice for implementing an all-to-all personalized exchange due to its shorter communication latency and better scalability.

[1]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[2]  Chunming Qiao,et al.  A time domain approach for avoiding crosstalk in optical blocking multistage interconnection networks , 1994 .

[3]  Mark A. Franklin,et al.  Design of an optically-interconnected multiprocessor , 1998, Proceedings. Fifth International Conference on Massively Parallel Processing (Cat. No.98EX182).

[4]  Yu-Chee Tseng,et al.  Bandwidth-Optimal Complete Exchange on Wormhole-Routed 2D/3D Torus Networks: A Diagonal-Propagation Approach , 1997, IEEE Trans. Parallel Distributed Syst..

[5]  Young-Joo Suh,et al.  Efficient all-to-all personalized exchange in multidimensional torus networks , 1998, Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205).

[6]  Yi Pan,et al.  Permutation Capability of Optical Multistage Interconnection Networks , 2000, J. Parallel Distributed Comput..

[7]  Allan Gottlieb,et al.  Highly parallel computing , 1989, Benjamin/Cummings Series in computer science and engineering.

[8]  Yi Pan,et al.  Optical multistage interconnection networks: new challenges and approaches , 1999, IEEE Commun. Mag..

[9]  D. S. Scott,et al.  Efficient All-to-All Communication Patterns in Hypercube and Mesh Topologies , 1991, The Sixth Distributed Memory Computing Conference, 1991. Proceedings.

[10]  Young-Joo Suh,et al.  All-to-All Personalized Communication in Multidimensional Torus and Mesh Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[11]  Young-Joo Suh,et al.  Configurable Algorithms for Complete Exchange in 2D Meshes , 2000, IEEE Trans. Parallel Distributed Syst..

[12]  Kenneth P. Bogart,et al.  Introductory Combinatorics , 1977 .

[13]  Rami G. Melhem,et al.  Reconfiguration with Time Division Multiplexed MIN's for Multiprocessor , 1994, IEEE Trans. Parallel Distributed Syst..

[14]  Yuanyuan Yang,et al.  Optimal all-to-all personalized exchange in a class of optical multistage networks , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[15]  Fikret Erçal,et al.  Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures , 1997, J. Parallel Distributed Comput..

[16]  C. Qiao,et al.  Reconfiguration With Time Division Multiplexed MINs for Multiprocessor Communications , 1994 .

[17]  S. Lennart Johnsson,et al.  Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures , 1987, J. Parallel Distributed Comput..

[18]  Chunming Qiao,et al.  Scheduling switching element (SE) disjoint connections in stage-controlled photonic banyans , 1999, IEEE Trans. Commun..

[19]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[20]  Sandeep K. S. Gupta,et al.  All-to-All Personalized Communication in a Wormhole-Routed Torus , 1996, IEEE Trans. Parallel Distributed Syst..

[21]  Young-Joo Suh,et al.  All-To-All Communication with Minimum Start-Up Costs in 2D/3D Tori and Meshes , 1998, IEEE Trans. Parallel Distributed Syst..

[22]  Evan L. Goldstein,et al.  Optical crossconnects for high-capacity lightwave networks , 1999, J. High Speed Networks.

[23]  Yuanyuan Yang,et al.  Optimal All-to-All Personalized Exchange in Self-Routable Multistage Networks , 2000, IEEE Trans. Parallel Distributed Syst..

[24]  David R. O'Hallaron,et al.  An architecture for optimal all-to-all personalized communication , 1994, SPAA '94.

[25]  Rajeev Thakur,et al.  All-to-all communication on meshes with wormhole routing , 1994, Proceedings of 8th International Parallel Processing Symposium.

[26]  T. Murphy A strictly non-blocking 16×16 electro-optic photonic switch module , 2000 .

[27]  Dennis Gannon,et al.  On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms , 1984, IEEE Transactions on Computers.