This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Realization of Any BPC Permutation on K-Extra-Stage Omega Networks
May 1995 (vol. 44 no. 5)
pp. 714-719

Abstract—An N×N k-Omega network is obtained by adding k more stages in front of an Omega network. An N-permutation defines a bijection between the set of N sources and the set of N destinations. Such a permutation is said to be admissible to a k-Omega if N conflict-free paths, one for each source-destination pair defined by the permutation, can be established simultaneously. When an N-permutation is not admissible, it is desirable to divide the N pairs into a minimum number of groups (passes) such that the conflict-free paths can be established for the pairs in each group. Raghavendra and Varma solved this problem for BPC (Bit Permutation Complement) permutations on an Omega without extra stage. This paper generalizes their result to a k-Omega where k can be any integer between 0 and n  1. An O(NlgN) algorithm is given which realizes any BPC permutation in a minimum number of passes on a k-Omega (0 ≤kn  1).

[1] C. WuXiaojun ShenMemberIEEE and T. Feng,“The universality of the shuffle-exchange network,” IEEE Trans. Computers, vol. 30, pp. 324-332, May 1981.
[2] D.P. Agwaral,“Graph theoretical analysis and design of multistage interconnection networks,” IEEE Trans. Computers, vol. 32, pp. 637-648, July 1983.
[3] C. Wu and T. Feng,“On a class of multistage interconnection networks,” IEEE Trans. Computers, vol. 29, pp. 694-702, Aug. 1980.
[4] G.B. Adams III and H.J. Siegel,“The extra stage cube: A fault-tolerant interconnection network for supersystems,” IEEE Trans. Computers, vol. 31, pp. 443-454, May 1982.
[5] C.L. Wu,T.Y. Feng,, and M.C. Lin,“Star: A local network system for real-time management of imagery data,” IEEE Trans. Computers, vol. 31, pp. 923-933, Oct. 1982.
[6] I. Gazit and M. Malek,"On the number of permutations performable by extra-stage multistage interconnection networks," IEEE Trans. Computers, vol. 38, no. 2, pp. 297-302, Feb. 1989.
[7] C.T. Lea and D.J. Shyy,“Tradeoff of horizontal decomposition versus vertical stackingin rearrangeable nonblocking networks,” IEEE Trans. Communications, vol. 39, pp. 899-904, 1991.
[8] D.J. Shyy and C.T. Lea,“Log2(N,m,p) strictly nonblocking networks,” IEEE Trans. Communications, vol. 39, pp. 1,502-1,510, 1991.
[9] X. Shen,M. Xu, and X. Wang,"An optimal algorithm for permutation admissibility to multistage interconnection networks," IEEE Trans. Computers, vol. 44, no. 4, pp. 604-608, Apr. 1995.
[10] X. Shen,“An optimal algorithm for permutation admissibility to extra-stagecube-type networks,” to appear in IEEE Trans. Computers.
[11] C.J.A. Hsia and C.Y. Chen,“Permutation capability of multistage interconnection networks,” Proc. Int’l Conf. Parallel Processing, pp. I-338-346, 1990.
[12] C.S. Raghavendra and A. Varma,“Fault-tolerant multiprocessors with redundant-path interconnection networks,” IEEE Trans. Computers, vol. 35, No. 4, Apr. 1986.
[13] J.P. Hayes,Computer Architecture and Organization, Second Edition, McGraw-Hill, 1988.
[14] K. Hwang and F.A. Briggs,Computer Architecture and Parallel Processing.New York: McGraw Hill, 1984.
[15] H.J. Siegel, Interconnection Networks for Large-Scale Parallel Processing, Second Ed., McGraw-Hill, New York, 1990.
[16] A. Abdennadher and T. Feng,“On rearrangeability of Omega-Omega networks,” Proc. 1992 Int’l Conf. Parallel Processing, pp. I-159-165, 1992.
[17] N. Das,B.B. Bhattacharya,, and J. Dattagupta,“Analysis of conflict graphs in multi-stage interconnection networks,” Proc. IEEE Region 10 Conf. on Computer and Communication Systems, pp. 175-179, Sept. 1990.
[18] Q. Hu,X. Shen,, and W. Liang,“Optimally Routing LC Permutations on k-Extra-Stage Cube-TypeNetworks,” to appear in IEEE Trans. Computers.

Index Terms:
BPC permutation, conflict graph, graph coloring, k-Omega network, permutation realization.
Citation:
Xiaojun Shen, "Optimal Realization of Any BPC Permutation on K-Extra-Stage Omega Networks," IEEE Transactions on Computers, vol. 44, no. 5, pp. 714-719, May 1995, doi:10.1109/12.381960
Usage of this product signifies your acceptance of the Terms of Use.