This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Interconnects
April 2003 (vol. 14 no. 4)
pp. 383-393
Jianchao Wang, IEEE Computer Society

Abstract—In this paper, we consider efficiently routing permutations in a class of switch-based interconnects. Permutation is an important communication pattern in parallel and distributed computing systems. We present a generic approach to realizing arbitrary permutations in a class of unique-path, self-routable interconnects. It is well-known that this type of interconnect has low hardware cost, but can realize only a small portion of all possible permutations between its inputs and outputs in a single pass. In this paper, we consider routing arbitrary permutations with link-disjoint paths and node-disjoint paths in such interconnects in a minimum number of passes. In particular, routing with node-disjoint paths has important applications in the emerging optical interconnects. We employ and further expand the Latin square technique used in the all-to-all personalized exchange algorithms for this class of interconnects for general permutation routing. As can be seen, our implementation of permutation routing is optimal in terms of the number of passes that messages are transmitted through the network, and it is near-optimal in network transmission time for sufficiently long messages. The possibility of adopting a single-stage interconnect is also discussed.

[1] 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.
[2] InfiniBand Architecture Specification 1.0, The InfiniBand Trade Association,http:/www.infinibandta.org, Oct. 2000.
[3] C.-L. Wu and T.-Y. Feng, “On a Class of Multistage Interconnection Networks,” IEEE Trans. Computers, vol. 29, no. 8, pp. 694-702, Aug. 1980.
[4] J. Duato, S. Yalamanchili, and L.M. Ni, Interconnection Networks: An Engineering Approach. Morgan Kauffman, 2003.
[5] 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.
[6] 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.
[7] Q. Gu and S. Peng, “Wavelength Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks,” Proc. Int'l Parallel and Distributed Processing Symp., pp. 761-768, May 2000.
[8] Q. Gu and S. Peng, “Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks,” Proc. 2000 Int'l Conf. Parallel Processing, pp. 513-520, Aug. 2000.
[9] 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.
[10] Y. Yang and J. Wang, “Optimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 6, pp. 567-582, June 2001.
[11] V.E. Benes, “Optimal Rearrangeable Multistage Connecting Networks,” The Bell System Technical J., vol. 43, pp. 1641-1656, 1964.
[12] D.S. Parker, Jr., “Notes on Shuffle/Exchange-Type Switching Networks,” IEEE Trans. Computers, vol. 29, no. 3, pp. 213-222, 1980.
[13] C.-L. Wu and T.-Y. Feng, “The Universality of the Shuffle-Exchange Network,” IEEE Trans. Computers, vol. 30, no. 5, pp. 324-332, May 1981.
[14] S.T. Huang and S.F. Tripathi,“Finite state model and compatibility theory: New analysis tools for permutation networks,” IEEE Trans. Computers, vol. 35, pp. 591-601, July 1986.
[15] A. Verma and C.S. Raghavendra, “Rearrangeability of Multistage Shuffle/Exchange Networks,” IEEE Trans. Computers, vol. 36, no. 10, pp. 1138-1147, Oct. 1988.
[16] C.Y. Jan and A.Y. Oruç, “Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network,” IEEE Trans. Computers, vol. 42, no. 12, pp. 1,469-1,479, Dec. 1993.
[17] D.M. Koppelman and A.Y. Oruç, “Complexity of Routing in Permutation Networks,” IEEE Trans. Information Theory, vol. 40, no. 1, pp. 278-284, 1994.
[18] W.-J. Cheng and W.-T. Chen, “A New Self-Routing Permutation Network,” IEEE Trans. Computers, vol. 45, no. 5, pp. 630-636, May 1996.
[19] Y. Yang and J. Wang, “Wide-Sense Nonblocking Clos Networks under Packing Strategy,” IEEE Trans. Computers, vol. 48, no. 3, pp. 265-284, Mar. 1999.
[20] S.-W. Seo, T.-Y. Feng, and H.-I. Lee, Permutation Realizability and Fault Tolerance Property of the Inside-Out Routing Algorithm IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 9, pp. 946-957, Sept. 1999.
[21] W.K. Lai, “Performing Permutations on Interconnection Networks by Regularly Changing Switch States,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 8, pp. 829-837, Aug. 2000.
[22] K.P. Bogart, Introductory Combinatorics. third ed., Harcourt Academic Press, 2000.

Index Terms:
Routing, permutation, all-to-all personalized exchange, interconnects, optical interconnects, multistage networks, link-disjoint paths, node-disjoint paths, crosstalk-free routing, Latin square.
Citation:
Yuanyuan Yang, Jianchao Wang, "Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Interconnects," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 4, pp. 383-393, April 2003, doi:10.1109/TPDS.2003.1195410
Usage of this product signifies your acceptance of the Terms of Use.