Frames: a simple characterization of permutations realized by frequently used networks

DOI10.1109/12.381954MaRDI QIDQ4419700zbMATH OpenOpenAlexFDO

Authors Hasan Cam, José A. B. Fortes

Publication date 14 October 2003

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://docs.lib.purdue.edu/ecetr/309

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Balanced permutations and multistage interconnection networks
• Rearrangeability of (2n-1)-Stage Shuffle-Exchange Networks
• scientific article; zbMATH DE number 3930907
• Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks
• Rearrangeability of bit permutation networks

Cited in

(6)

• Permutation capability of optical multistage interconnection networks
• Fast reconfiguration algorithms for time, space, and wavelength dilated optical Benes networks
• Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks
• Partitioning and permuting properties of CC-banyan networks
• Balanced permutations and multistage interconnection networks
• Rearrangeability of bit permutation networks

This page was built for publication: Frames: a simple characterization of permutations realized by frequently used networks

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