Graphs and algorithms
Interconnection networks for large-scale parallel processing: theory and case studies
Interconnection networks for large-scale parallel processing: theory and case studies
Fault-Tolerant Multiprocessors with Redundant-Path Interconnection Networks
IEEE Transactions on Computers - The MIT Press scientific computation series
Parallel computing: theory and comparisons
Parallel computing: theory and comparisons
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Optimally Routing LC Permutations on k-Extra-Stage Cube-Type Networks
IEEE Transactions on Computers
IEEE/ACM Transactions on Networking (TON)
Optimal Realization of Any BPC Permutation on K-Extra-Stage Omega Networks
IEEE Transactions on Computers
An Optimal O(NlgN) Algorithm for Permutation Admissibility to Extra-Stage Cube-Type Networks
IEEE Transactions on Computers
Recent developments in optical multistage networks
Optical networks
| Hi-index | 14.99 |
The number of permutations performable by extra-stage multistage interconnection networks in a single pass is studied. A graph-theoretical approach is used to evaluate the multiplicity of the performable permutations. More specifically, the problem is reduced to a hypercube enumeration problem, and it is shown that there is a direct correspondence between the number of partial subgraphs of a hypercube with a given number of components, and the multiplicity of a corresponding class of permutations performable by the extra- stage network. The evaluation of these multiplicities leads to the calculation of the number of distinct permutations performable by the network.