Rearrangeability of bit permutation networks

DOI10.1016/J.TCS.2005.09.077MaRDI QIDQ818130zbMATH OpenOpenAlexFDO

Authors Qiao Li, Xuewen Bao, Frank K. Hwang

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

balanced matrixlayered cross productmultistage interconnection networkpermutationrearrangeability

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Rearrangeability of (2n-1)-Stage Shuffle-Exchange Networks
• Frames: a simple characterization of permutations realized by frequently used networks
• On the rearrangeability of shuffle-exchange networks
• scientific article; zbMATH DE number 4063007
• On the Rearrangeability of 2(Iog₂N) –1 Stage Permutation Networks

Cites work

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

Cited in

(6)

• A rearrangement algorithm for switching networks composed of digital symmetrical matrices
• Stride permutation networks for array processors
• Frames: a simple characterization of permutations realized by frequently used networks
• Undirected graphs rearrangeable by 2-length walks
• Rearrangeability of (2n-1)-Stage Shuffle-Exchange Networks
• Channel graphs of bit permutation networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q818130)