Rearrangeability of bit permutation networks

Authors:
Xuewen Bao;Frank K. Hwang;Qiao Li
Affiliations:
Department of Mathematics, Shanghai Jiaotong University, Shanghai, China;Department of Applied Mathematics, National Chiaotung University, Hsinchu, Taiwan;Department of Mathematics, Shanghai Jiaotong University, Shanghai, China
Venue:
Theoretical Computer Science
Year:
2006

Citing 8
Cited 0

Equivalence of multistage interconnection networks

Information Processing Letters
Interpolation between bases and the shuffle exchange network

European Journal of Combinatorics
A New Routing Algorithm for a Class of Rearrangeable Networks

IEEE Transactions on Computers
Topologies of Combined (2logN - 1)-Stage Interconnection Networks

IEEE Transactions on Computers
On the Correctness of Inside-Out Routing Algorithm

IEEE Transactions on Computers
Frames: A Simple Characterization of Permutations Realized by Frequently Used Networks

IEEE Transactions on Computers
Rearrangeability of $(2\protectn-1)$-Stage Shuffle-Exchange Networks

SIAM Journal on Computing
Graphs and Hypergraphs

Graphs and Hypergraphs

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we introduce the concept of routing grid as a tool for analyzing realizability of permutations on bit permutation networks (BPNs). We extend a result by Linial and Tarsi which characterizes permutations realizable on shuffle-exchange networks to any BPNs. A necessary condition for a BPN to he rearrangeable is given, and the rearrangeability of two families of BPNs are explored. Finally, we present a method which may help to tackle one kind of balanced matrix problems whose solution implies an answer to Benes conjecture. Hopefully, our treatment brings some new insight into the problem of permutation routing.