This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Isomorphism of Conflict Graphs in Multistage Interconnection Networks and its Application to Optimal Routing
June 1993 (vol. 42 no. 6)
pp. 665-677

A study on the isomorphism of conflict graphs in multistage interconnection networks (MINs) and its applications is outlined. A concept called group-transformation is introduced for the baseline network, which induces an equivalence partition on the set of all permutations. All members belonging to the same equivalence class have isomorphic conflict graphs. Thus, determination of conflict resolution of one permutation results in determination of conflict resolution of all other equivalent members. The BPCL (bit-permute-closure) class of permutations is defined, for which the conflict resolution problem can be settled in linear time by an earlier algorithm developed only for the BPC (bit-permute-complement) permutations. It is proved that for an N*N MIN, mod BPCL mod

[1] M. A. Abidi and D. P. Agrawal, "On conflict-free permutations in multistage interconnection network,"J. Digital Syst., vol. V, pp. 115-136, 1980.
[2] D. P. Agrawal, "Graph theoretical analysis and design of multistage interconnection networks,"IEEE Trans. Comput., vol. C-32, no. 7, pp. 637-648, July 1983.
[3] D. Nassimi and S. Sahni, "Optimal BPC permutations on a cube connected computer,"IEEE Trans. Comput., vol. C-31, pp. 338-341, Apr. 1982.
[4] C. S. Raghavendra and A. Varma, "Fault-tolerant multiprocessors with redundant path interconnection network,"IEEE Trans. Comput., vol. C-35, no. 4, pp. 307-316, Apr. 1986.
[5] C. L. Wu and T. Y. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C-29, pp. 694-702, Aug. 1980.
[6] H. J. Siegel, "A model of SIMD machines and a comparison of various interconnection networks,"IEEE Trans. Comput., vol. C-28, pp. 907-917, Dec. 1978.
[7] D. K. Pradhan and K. L. Kodandapani, "A uniform representation of single and multistage interconnection networks used in SIMD machines,"IEEE Trans. Comput., vol. C-29, pp. 777-790, Sept. 1980.
[8] F. Harary,Graph Theory. Boston, MA: Addison-Wesley, 1969.
[9] N. Das, B. B. Bhattacharya, and J. Dattagupta, "A study of conflict graphs and optimal routing in interconnection networks," Tech. Report No. P&E/E/002-89, ISI, Calcutta, India, 1989.
[10] D. Nassimi, "A fault-tolerant routing algorithm for BPC permutations on multistage interconnection networks," inProc. of 1989 Int. Conf. Parallel Processing, Aug. 1989, pp. I-278-I-287.
[11] N. Das, K. Mukhopadhyaya, and J. Dattagupta, "On self-routable permutations in Benes network," inProc. 1991 Int. Conf. Parallel Processing, Aug. 1991, pp. I-270-I-273.
[12] P. J. Bernherd and D. J. Rosenkrantz, "An efficient method for representing and transmitting message patterns on multiprocessor interconnection networks,"J. Parallel Distributed Comput., vol. 11, pp. 72-85, 1991.

Index Terms:
multistage interconnection networks; optimal routing; conflict graphs; MINs; group-transformation; equivalence partition; equivalence class; BPCL; bit-permute-closure; conflict resolution; equivalence classes; multiprocessor interconnection networks.
Citation:
N. Das, B.B. Bhattacharya, J. Dattagupta, "Isomorphism of Conflict Graphs in Multistage Interconnection Networks and its Application to Optimal Routing," IEEE Transactions on Computers, vol. 42, no. 6, pp. 665-677, June 1993, doi:10.1109/12.277286
Usage of this product signifies your acceptance of the Terms of Use.