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.)
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
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
Permutation routing in optical MIN with minimum number of stages
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 |
This paper introduces a simple O(NlogN) sequential algorithm that determines the admissibility of an arbitrary permutation to an N脳N Multistage Cube-Type Network (MCTN) implemented by 2 脳 2 switching elements (SEs) in contrast to previous O(Nlog2N) algorithms. It is proven that the new algorithm is optimal in the sense that any algorithm, based on bit-operations, has to examine at least (N/4)logN different bits among the total NlogN bits in the binary representations of the destinations numbered from 0 through N驴1.