On a Class of Rearrangeable Networks
IEEE Transactions on Computers
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
On the Correctness of Inside-Out Routing Algorithm
IEEE Transactions on Computers
Comment on "A New Routing Algorithm for a Class of Rearrangeable Networks"
IEEE Transactions on Computers
Work-Efficient Routing Algorithms for Rearrangeable Symmetrical Networks
IEEE Transactions on Parallel and Distributed Systems
Permutation Realizability and Fault Tolerance Property of the Inside-Out Routing Algorithm
IEEE Transactions on Parallel and Distributed Systems
Hierarchical multistage interconnection network for shared-memory multiprocessor system
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
The KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network
IEEE Transactions on Computers
More on rearrangeability of combined (2n - 1)-stage networks
Journal of Systems Architecture: the EUROMICRO Journal
Rearrangeability of bit permutation networks
Theoretical Computer Science
A General Inside-Out Routing Algorithm for a Class of Rearrangeable Networks
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Fault Tolerant Interleaved Switching Fabrics For Scalable High-Performance Routers
IEEE Transactions on Parallel and Distributed Systems
On rearrangeability of tandem connection of banyan-type networks
IEEE Transactions on Communications
| Hi-index | 14.99 |
This paper presents a routing algorithm for a class of multistage interconnection networks. Specifically, the concatenation of two Omega networks which has 2 log/sub 2/ N stages is treated. It is shown that this kind of asymmetric Omega+Omega network can be converted into a symmetric Omega/sup -1spl times/Omega network or a symmetric Omega/spl times/Omega/sup -1/ network. However, they have butterfly connections between the two center stages. A general algorithm is developed which routes a class of symmetric networks. The algorithm routes the network from center stages to outer stages at both the input and the output sides simultaneously. The algorithm presented is simpler and more flexible than the well-known looping algorithm in that it can be applied adaptively according to the structure of the network. It can be applied to routing the Omega-based networks regardless of the center-stage connection patterns, i.e., straight, skewed straight, simple butterfly or skewed butterfly as long as the networks are symmetric. The sufficient conditions for proper routing are shown and proved. In addition, an example is shown to demonstrate the algorithm.