On the correctness of inside-out routing algorithm

IEEE Transactions on Computers

Volumn 46, Issue 7, 1997, Pages 820-823

  Kim, M K ^a,b   Yoon, H ^a,c   Maeng, S R ^a,c  

^a Woosuk University ^*

^b Woosuk University   (South Korea)

^c Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Asymmetric MINs; Multistage interconnection networks (MINs); Omega omega network; Rearrangeable networks; Routing algorithm

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING;

INSIDE OUT ROUTING ALGORITHMS; MULTISTAGE INTERCONNECTION NETWORKS (MIN); OMEGA OMEGA NETWORK; REARRANGEABLE NETWORKS;

INTERCONNECTION NETWORKS;

EID: 0031189693     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.599903     Document Type: Article

References (7)

1. V.E. Benes, "On Rearrangeable Three-Stage Connecting Networks," Bell Systems Technical J., vol. XVI, no. 5, pp. 1,481-1,492, 1962.
2. H. Cam and J.A.B. Fortes, "Frames: A Smple Characterization of Permutations Realized by Frequently Used Networks," IEEE Trans. Computers, vol. 44, no. 5, pp. 695-697, May 1995.
3. T.-Y. Feng and S.-W. Seo, "A New Routing Algorithm for a Class of Rearrangeable Networks," IEEE Trans. Computers, vol. 43, no. 11, pp. 1,270-1,280, Nov. 1994.
4. M.K. Kim, H. Yoon, and S.R. Maeng, "Bit-Permute Multistage Interconnection Networks," Microprocessing and Microprogramming, vol. 41, pp. 449-468, 1995.
5. 2 N) - 1 State Permutation Networks," IEEE Trans. Computers, vol. 34, no. 5, pp. 412-425, May 1985.
6. D.C. Opferman and N.T. Tsao-Wu, "On a Class of Rearrangeable Switching Networks - Part I: Control Algorithm," Bell Systems Technical J., vol. 50, no. 5, pp. 1,579-1,600, 1971.
7. Y.-M. Yeh and T.-Y. Feng, "On a Class of Rearrangeable Networks," IEEE Trans. Computers, vol. 41, no. 11, pp. 1,361-1,379, Nov. 1992.