A Unified theory of interconnection network structure
Theoretical Computer Science
Properties of multistage interconnection networks
Properties of multistage interconnection networks
Equivalence Between Functionality and Topology of Log N-Stage Banyan Networks
IEEE Transactions on Computers
Analysis and Design of Nonequivalent Multistage Interconnection Networks
IEEE Transactions on Computers
Study of multistage SIMD interconnection networks
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Hi-index | 0.00 |
Relations among banyan multistage interconnection networks (MINs) of differing switchsizes are studied. If two N*N networks W and W' have switch sizes r and s, respectively,and if r is greater than s, then W realizes a larger number of permutations than W'. Consequently, thetwo networks can never be equivalent. However, W may realize all the permutations ofW', in which case W is said to functionally cover W' in the strict sense. More generally, W is said to functionally cover W' in the wide sense if the terminals of W can be relabeled so that W realizes all the permutations of W'. Functional covering is topologically characterized, and an optimal algorithm to decide strict functional covering is developed.