Fault-Tolerant Multiprocessors with Redundant-Path Interconnection Networks
IEEE Transactions on Computers - The MIT Press scientific computation series
Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
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.)
On Self-Routing in Benes and Shuffle-Exchange Networks
IEEE Transactions on Computers
Self-routing algorithms for strongly regular multistage interconnection networks
Journal of Parallel and Distributed Computing
Computer Architecture and Parallel Processing
Computer Architecture and Parallel Processing
An Optimal Algorithm for Permutation Admissibility to Multistage Interconnection Networks
IEEE Transactions on Computers
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
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
ARC '09 Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications
| Hi-index | 14.98 |
It is difficult to partition an arbitrary permutation into a minimum number of groups such that conflict-free paths for all source-destination pairs in each group can be established on an omega network. Based on linear algebra theory, this paper presents an optimal algorithm which solves this problem for the LC class of permutations on a large class of multi-stage networks. This algorithm extends the previous result which deals with the BPC class of permutations on the omega network