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.)
Optimally Routing LC Permutations on k-Extra-Stage Cube-Type Networks
IEEE Transactions on Computers
Computer Architecture and Parallel Processing
Computer Architecture and Parallel Processing
An Optimal Algorithm for Permutation Admissibility to Multistage Interconnection Networks
IEEE Transactions on Computers
An Optimal O(NlgN) Algorithm for Permutation Admissibility to Extra-Stage Cube-Type Networks
IEEE Transactions on Computers
Optimally Routing LC Permutations on k-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
Performing BMMC Permutations in Two Passes through the Expanded Delta Network and MasPar MP-2
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
| Hi-index | 14.98 |
An N脳N k-Omega network is obtained by adding k more stages in front of an Omega network. An N-permutation defines a bijection between the set of N sources and the set of N destinations. Such a permutation is said to be admissible to a k-Omega if N conflict-free paths, one for each source-destination pair defined by the permutation, can be established simultaneously. When an N-permutation is not admissible, it is desirable to divide the N pairs into a minimum number of groups (passes) such that the conflict-free paths can be established for the pairs in each group. Raghavendra and Varma solved this problem for BPC (Bit Permutation Complement) permutations on an Omega without extra stage. This paper generalizes their result to a k-Omega where k can be any integer between 0 and n驴驴1. An O(NlgN) algorithm is given which realizes any BPC permutation in a minimum number of passes on a k-Omega (0 驴k驴n驴驴1).