This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks
June 2001 (vol. 12 no. 6)
pp. 567-582

Abstract—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 will 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] D. Gannon and J.V. Rosendale, “On the Impact of Communication Complexity in the Design of Parallel Numerical Algorithms,” IEEE Trans. Computer, pp. 1180-1194, Dec. 1984.
[2] S.L. Johnsson, "Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures," J. Parallel and Distributed Computing, vol. 4, pp. 133-172, 1987.
[3] S.L. Johnsson and C.T. Ho,“Spanning graphs for optimum broadcasting and personalizedcommunication in hypercubes,” IEEE Trans. Computers, vol. 38, no. 9, pp. 1,249-1,268, Sept. 1989.
[4] R. Thakur and A. Choudhary, "All-to-All Communication on Meshes with Wormhole Routing," Proc. Eighth Int'l Parallel Processing Symp., pp. 561-565, Apr. 1994.
[5] S. Hinrichs, C. Kosak, D.R. O'Hallaron, T.M. Sticker, and R. Take, "An Architecture for Optimal All-to-All Personalized Communication," Proc. Symp. Parallel Algorithms and Architectures, pp. 310-319, 1994.
[6] Y.-C. Tseng and S. Gupta, “All-to-All Personalized Communication in a Wormhole-Routed Torus,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 5, pp. 498-505, May 1996.
[7] Y.-C. Tseng, T.-H. Lin, S. Gupta, and D.K. Panda, “Bandwidth-Optimal Complete Exchange on Wormhole Routed 2D/3D Torus Networks: A Diagonal-Propagation Approach,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 4, pp. 380-396, Apr. 1997.
[8] Y.J. Suh and S. Yalamanchili, “All-to-All Communication with Minimum Start-Up Costs in 2D/3D Tori and Meshes,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 5, pp. 442-458, May 1998.
[9] Y.J. Suh and K.G. Shin, “All-to-All Personalized Communication in Multidimensional Torus and Mesh Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 1, pp. 38-59, Jan. 2001.
[10] Y.J. Suh and S. Yalamanchili, “Configurable Algorithms for Complete Exchange in 2D Meshes,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 4, pp. 337-356, Apr. 2000.
[11] Y. Yang and J. Wang, “Optimal All-to-All Personalized Exchange in Self-Routable Multistage Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 3, pp. 261-274, Mar. 2000.
[12] J. Duato, S. Yalamanchili, and L.M. Ni, Interconnection Networks: An Engineering Approach. Los Alamitos, Calif.: IEEE CS Press, 1997.
[13] C. Qiao and R. Melhem, "Reconfiguration with Time Division Multiplexed MIN's for Multiprocessor Communications," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 4, pp. 337-351, Apr. 1994.
[14] R.D. Chamberlain, M.A. Franklin, and R.R. Krchnavek, “Design of an Optically-Interconnected Multiprocessor,” Proc. IEEE Fifth Int'l Conf. Massively Parallel Processing Using Optical Interconnections (MPPOI '98), pp. 114-122, June 1998.
[15] Y. Yang, J. Wang, and Y. Pan, “Permutation Capability of Optical Multistage Interconnection Networks,” J. Parallel and Distributed Computing, vol. 60, no. 1, pp. 72-91, Jan. 2000.
[16] T. Murphy et al., “A Strictly Non-Blocking$16 \times 16$Electrooptic Photonic Switch Module,” Proc. 26th European Conf. Optical Comm. (ECOC 2000), Sept. 2000.
[17] L. Lin, E. Goldstein, L. Lunardi, and R. Tkach, “Optical Crossconnects for High-Capacity Lightwave Networks,” J. High Speed Networks, vol. 8, no. 1, pp. 17-34, 1999.
[18] C. Qiao, R. Melhem, D. Chiarulli, and S. Levitan, “A Time Domain Approach for Avoiding Crosstalk in Optical Blocking Multistage Interconnection Networks,” J. Lightwave Technology, vol. 12, no. 10, pp. 1854-1862, Oct. 1994.
[19] C. Qiao and L. Zhou, “Scheduling Switching Element Disjoint Connections in Stage-Controlled Photonic Banyans,” IEEE Trans. Comm., vol. 47, no. 1, pp. 139-148, 1999.
[20] Y. Pan, C. Qiao, and Y. Yang, “Optical Multistage Interconnection Networks: New Challenges and Approaches,” IEEE Comm., vol. 37, no. 2, pp. 50-56, Feb. 1999.
[21] K.P. Bogart, Introductory Combinatorics, second ed., Harcourt Brace Jova novich, 1990.

Index Terms:
Optical networks, multistage networks, all-to-all communication, all-to-all personalized exchange, permutation, semipermutation, Latin square, crosstalk.
Citation:
Yuanyuan Yang, Jianchao Wang, "Optimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 6, pp. 567-582, June 2001, doi:10.1109/71.932711
Usage of this product signifies your acceptance of the Terms of Use.