The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (1985 vol.34)
pp: 773-776
ABSTRACT
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
M.Y. Oruc, N. Balabanian, "Reconfiguration Algorithms for Interconnection Networks", IEEE Transactions on Computers, vol.34, no. 8, pp. 773-776, August 1985, doi:10.1109/TC.1985.1676628
43 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool