Rearrangeability of bit permutation networks

DOI10.1016/j.tcs.2005.09.077zbMath1086.68010OpenAlexW1996287506MaRDI QIDQ818130

Qiao Li, Frank K. Hwang, Xue-Wen Bao

Publication date: 24 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.077

zbMATH Keywords

permutationmultistage interconnection networkbalanced matrixlayered cross productrearrangeability

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interpolation between bases and the shuffle exchange network
• Efficient algorithms for checking the equivalence of multistage interconnection networks
• Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks
• Rearrangeability of the Five-Stage Shuffle/Exchange Network for N = 8
• Proving the Rearrangeability of Connecting Networks by Group Calculations
• Layered cross product&mdashA technique to construct interconnection networks
• Frames: a simple characterization of permutations realized by frequently used networks
• A new routing algorithm for a class of rearrangeable networks
• Rearrangeability of (2n-1)-Stage Shuffle-Exchange Networks
• On a Class of Rearrangeable Switching Networks Part I: Control Algorithm

This page was built for publication: Rearrangeability of bit permutation networks