Fault-Tolerant Multiprocessors with Redundant-Path Interconnection Networks
IEEE Transactions on Computers - The MIT Press scientific computation series
Computer architecture and organization; (2nd ed.)
Computer architecture and organization; (2nd ed.)
On the Number of Permutations Performable by Extra-Stage Multistage Interconnection Networks
IEEE Transactions on Computers
Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.)
Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.)
Computer Architecture and Parallel Processing
Computer Architecture and Parallel Processing
An Optimal Algorithm for Permutation Admissibility to Multistage Interconnection Networks
IEEE Transactions on Computers
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
Permutation routing in optical MIN with minimum number of stages
Journal of Systems Architecture: the EUROMICRO Journal
More on rearrangeability of combined (2n - 1)-stage networks
Journal of Systems Architecture: the EUROMICRO Journal
On path dependent loss and switch crosstalk reduction in optical networks
Information Sciences: an International Journal
| Hi-index | 14.99 |
A k-EMCTN is obtained by adding k more stages in front of a multistage cube-type network (MCTN). It is shown that a permutation is admissible to a k-EMCTN if and only if the conflict graph is 2k-colorable. For the case k= 1, an O(NlgN) algorithm is given for constructing the conflict graph, which leads to an O(NlgN) admissibility algorithm. Furthermore, it is shown that 驴(NlgN) bits must be checked in the binary representation of a permutation for determining its admissibility.