This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Reconfiguration Algorithms for Interconnection Networks
August 1985 (vol. 34 no. 8)
pp. 773-776
A.Y. Oruc, Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute
The correspondence examines the functional relations within a class of multistage interconnection networks. It is known that these networks are not rearrangeable. This fact has led to some research on interconnection network relations. The correspondence deals with one aspect of this research, namely, that of constructing an equivalence map between two interconnection networks. Procedures are given to test whether two such networks are equivalent. Whenever they are, these procedures also produce a map to conjugate one network onto the other.
Index Terms:
permutation map, Conjugation map, cycle map, functional equivalence, interconnection network
Citation:
A.Y. Oruc, M.Y. Oruc, N. Balabanian, "Reconfiguration Algorithms for Interconnection Networks," IEEE Transactions on Computers, vol. 34, no. 8, pp. 773-776, Aug. 1985, doi:10.1109/TC.1985.1676628
Usage of this product signifies your acceptance of the Terms of Use.