The Community for Technology Leaders
Green Image
Nonequivalence of multistage interconnection networks is established by obtaining a reduced graph model and then partitioning it into several bipartite subgraphs. This is shown to transform nonequivalence to nonisomorphism, which can be easily determined by examining the intrinsic characteristics of undirected loops. A reverse process allows the design of nonequivalent networks.
nonequivalent multistage interconnection networks; reduced graph model; bipartite subgraphs; nonisomorphism; equivalence classes; graph theory; multiprocessor interconnection networks.
S.-C. Kim, D.P. Agrawal, N.K. Swain, "Analysis and Design of Nonequivalent Multistage Interconnection Networks", IEEE Transactions on Computers, vol. 37, no. , pp. 232-237, February 1988, doi:10.1109/12.2154
88 ms
(Ver 3.3 (11022016))