This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Routing Permutations on Baseline Networks with Node-Disjoint Paths
August 2005 (vol. 16 no. 8)
pp. 737-746
Jianchao Wang, IEEE Computer Society

Abstract—Permutation is a frequently-used communication pattern in parallel and distributed computing systems and telecommunication networks. Node-disjoint routing has important applications in guided wave optical interconnects where the optical "crosstalk” between messages passing the same switch should be avoided. In this paper, we consider routing arbitrary permutations on an optical baseline network (or reverse baseline network) with node-disjoint paths. We first prove the equivalence between the set of admissible permutations (or semipermutations) of a baseline network and that of its reverse network based on a step-by-step permutation routing. We then show that an arbitrary permutation can be realized in a baseline network (or a reverse baseline network) with node-disjoint paths in four passes, which beats the existing results [5], [6] that a permutation can be realized in an n \times n Banyan network with node-disjoint paths in O(n^{\frac{1}{2}}) passes. This represents the currently best-known result for the number of passes required for routing an arbitrary permutation with node-disjoint paths in unique-path multistage networks. Unlike other unique path MINs (such as omega networks or Banyan networks), only baseline networks have been found to possess such four-pass routing property. We present routing algorithms in both self-routing style and central-controlled style. Different from the recent work in [21], which also gave a four-pass node-disjoint routing algorithm for permutations, the new algorithm is efficient in transmission time for messages of any length, while the algorithm in [21] can work efficiently only for long messages. Comparisons with previous results demonstrate that routing in a baseline network proposed in this paper could be a better choice for routing permutations due to its lowest hardware cost and near-optimal transmission time.

[1] InfiniBand Architecture Specification 1.0, The InfiniBand Trade Assoc., Oct. 2000, http:/www.infinibandta.org.
[2] http://www.myri.commyrinet/, 2005.
[3] 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, Jan. 1999.
[4] C.-T. Lea and D.-J. Shyy, “Tradeoff of Horizontal Decomposition versus Vertical Stacking in Rearrangeable Nonblocking Networks,” IEEE Trans. Comm., vol. 39, no. 6, pp. 899-904, June 1991.
[5] M. Vaez and C.-T. Lea, “Strictly Nonblocking Directional-Coupler-Based Switching Networks under Crosstalk Constraint,” IEEE Trans. Comm., vol. 48, no. 2, pp. 316-323, Feb. 2000.
[6] G. Maier and A. Pattavina, “Design of Photonic Rearrangeable Networks with Zero First-Order Switching-Element-Crosstalk,” IEEE Trans. Comm., vol. 49, no. 7, pp. 1268-1279, July 2001.
[7] V.E. Benes, “Optimal Rearrangeable Multistage Connecting Networks,” The Bell System Technical J., vol. 43, pp. 1641-1656, 1964.
[8] D.S. Parker Jr., “Notes on Shuffle/Exchange-Type Switching Networks,” IEEE Trans. Computers, vol. 29, no. 3, pp. 213-222. Mar. 1980.
[9] J. Duato, S. Yalamanchili, and L.M. Ni, Interconnection Networks: An Engineering Approach. Morgan Kaufmann Publishers, 2002.
[10] 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.
[11] C.-L. Wu and T.-Y. Feng, “The Reverse-Exchange Interconnection Network,” IEEE Trans. Computers, vol. 29, no. 9, pp. 801-810, Sept. 1980.
[12] 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.
[13] S.-T. Huang and S.K. Tripathi, “Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks,” IEEE Trans. Computers, vol. 35, no. 7, pp. 591-601, July 1986.
[14] A. Verma and C.S. Raghavendra, “Rearrangeability of Multistage Shuffle/Exchange Networks,” IEEE Trans. Computers, vol. 36, no. 10, pp. 1138-1147, 1988.
[15] C.Y. Jan and A.Y. Oruç, “Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network,” IEEE Trans. Computers, vol. 45, no. 5, pp. 630-636, 1993.
[16] W.-J. Cheng and W.-T. Chen, “A New Self-Routing Permutation Network,” IEEE Trans. Computers, vol. 45, no. 5, pp. 630-636, 1996.
[17] Y. Yang et al., “Permutation Capability of Optical Multistage Interconnection Networks,” J. Parallel and Distributed Computing, vol. 60, no. 1, pp. 72-91, Jan. 2000.
[18] 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.
[19] 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.
[20] 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.
[21] Y. Yang and J. Wang, “Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Interconnects,” IEEE Trans. Parallel and Distributed Systems, vol 14, no. 4, pp. 383-393, Apr. 2003.
[22] K.P. Bogart, Introductory Combinatorics, third ed. Harcourt Academic Press, 2000.

Index Terms:
Routing, permutation, semipermutation, interconnects, optical interconnects, multistage networks, baseline network, link-disjoint paths, node-disjoint paths, crosstalk-free.
Citation:
Yuanyuan Yang, Jianchao Wang, "Routing Permutations on Baseline Networks with Node-Disjoint Paths," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 8, pp. 737-746, Aug. 2005, doi:10.1109/TPDS.2005.99
Usage of this product signifies your acceptance of the Terms of Use.