
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Yuanyuan Yang, Jianchao Wang, "Routing Permutations on Baseline Networks with NodeDisjoint Paths," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 8, pp. 737746, August, 2005.  
BibTex  x  
@article{ 10.1109/TPDS.2005.99, author = {Yuanyuan Yang and Jianchao Wang}, title = {Routing Permutations on Baseline Networks with NodeDisjoint Paths}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {16}, number = {8}, issn = {10459219}, year = {2005}, pages = {737746}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2005.99}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Routing Permutations on Baseline Networks with NodeDisjoint Paths IS  8 SN  10459219 SP737 EP746 EPD  737746 A1  Yuanyuan Yang, A1  Jianchao Wang, PY  2005 KW  Routing KW  permutation KW  semipermutation KW  interconnects KW  optical interconnects KW  multistage networks KW  baseline network KW  linkdisjoint paths KW  nodedisjoint paths KW  crosstalkfree. VL  16 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Permutation is a frequentlyused communication pattern in parallel and distributed computing systems and telecommunication networks. Nodedisjoint 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 nodedisjoint 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 stepbystep permutation routing. We then show that an arbitrary permutation can be realized in a baseline network (or a reverse baseline network) with nodedisjoint paths in four passes, which beats the existing results [5], [6] that a permutation can be realized in an
[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 StageControlled Photonic Banyans,” IEEE Trans. Comm., vol. 47, no. 1, pp. 139148, 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. 899904, June 1991.
[5] M. Vaez and C.T. Lea, “Strictly Nonblocking DirectionalCouplerBased Switching Networks under Crosstalk Constraint,” IEEE Trans. Comm., vol. 48, no. 2, pp. 316323, Feb. 2000.
[6] G. Maier and A. Pattavina, “Design of Photonic Rearrangeable Networks with Zero FirstOrder SwitchingElementCrosstalk,” IEEE Trans. Comm., vol. 49, no. 7, pp. 12681279, July 2001.
[7] V.E. Benes, “Optimal Rearrangeable Multistage Connecting Networks,” The Bell System Technical J., vol. 43, pp. 16411656, 1964.
[8] D.S. Parker Jr., “Notes on Shuffle/ExchangeType Switching Networks,” IEEE Trans. Computers, vol. 29, no. 3, pp. 213222. 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. 694702, Aug. 1980.
[11] C.L. Wu and T.Y. Feng, “The ReverseExchange Interconnection Network,” IEEE Trans. Computers, vol. 29, no. 9, pp. 801810, Sept. 1980.
[12] C.L. Wu and T.Y. Feng, “The Universality of the ShuffleExchange Network,” IEEE Trans. Computers, vol. 30, no. 5, pp. 324332, 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. 591601, July 1986.
[14] A. Verma and C.S. Raghavendra, “Rearrangeability of Multistage Shuffle/Exchange Networks,” IEEE Trans. Computers, vol. 36, no. 10, pp. 11381147, 1988.
[15] C.Y. Jan and A.Y. Oruç, “Fast SelfRouting Permutation Switching on an Asymptotically Minimum Cost Network,” IEEE Trans. Computers, vol. 45, no. 5, pp. 630636, 1993.
[16] W.J. Cheng and W.T. Chen, “A New SelfRouting Permutation Network,” IEEE Trans. Computers, vol. 45, no. 5, pp. 630636, 1996.
[17] Y. Yang et al., “Permutation Capability of Optical Multistage Interconnection Networks,” J. Parallel and Distributed Computing, vol. 60, no. 1, pp. 7291, Jan. 2000.
[18] Y. Yang and J. Wang, “Optimal AlltoAll Personalized Exchange in SelfRoutable Multistage Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 3, pp. 261274, 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. 829837, Aug. 2000.
[20] Y. Yang and J. Wang, “Optimal AlltoAll Personalized Exchange in a Class of Optical Multistage Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 6, pp. 567582, June 2001.
[21] Y. Yang and J. Wang, “Routing Permutations with LinkDisjoint and NodeDisjoint Paths in a Class of SelfRoutable Interconnects,” IEEE Trans. Parallel and Distributed Systems, vol 14, no. 4, pp. 383393, Apr. 2003.
[22] K.P. Bogart, Introductory Combinatorics, third ed. Harcourt Academic Press, 2000.