On a Class of Rearrangeable Networks
IEEE Transactions on Computers
A New Routing Algorithm for a Class of Rearrangeable Networks
IEEE Transactions on Computers
Bit-permute multistage interconnection networks
Microprocessing and Microprogramming
Frames: A Simple Characterization of Permutations Realized by Frequently Used Networks
IEEE Transactions on Computers
Permutation Realizability and Fault Tolerance Property of the Inside-Out Routing Algorithm
IEEE Transactions on Parallel and Distributed Systems
The KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network
IEEE Transactions on Computers
Rearrangeability of bit permutation networks
Theoretical Computer Science
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
Adaptive Routing Strategy for Large Scale Rearrangeable Symmetric Networks
International Journal of Grid and High Performance Computing
| Hi-index | 14.99 |
Recently, a new routing algorithm called inside-out routing algorithm was proposed for routing an arbitrary permutation in the omega-based 2log2N stage networks. This paper discusses the problems of the inside-out routing algorithm and shows that the suggested condition for proper routing in the omega-omega network is insufficient. An extended necessary and sufficient condition for proper routing in the omega-omega network is also suggested. However, it is unknown if any permutation can be successfully routed by a heuristic algorithm which follows the condition. Thus, the rearrangeability of the omega-omega network still remains an open problem.