Notes on Shuffle/Exchange-Type Switching Networks
From MaRDI portal
Recommendations
Cited in
(23)- A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network
- A unified theory of interconnection network structure
- Interpolation between bases and the shuffle exchange network
- Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks
- A layout for the shuffle-exchange network with theta(N^ 2 /log N) area
- A one-copy algorithm for 2-D shuffles for optical omega networks
- A shuffle-based alternative to the ADM interconnection architecture
- An asymptotically optimal layout for the shuffle-exchange graph
- Permuting data with the Omega network
- Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram
- A unified framework for off-line permutation routing in parallel networks
- A new policy to solve routing conflicts in shuffle-exchange networks
- Invariant Properties of the Shuffle-Exchange and a Simplified Cost-Effective Version of the Omega Network
- scientific article; zbMATH DE number 3930907 (Why is no real title available?)
- On the construction of balanced matrices
- scientific article; zbMATH DE number 176262 (Why is no real title available?)
- scientific article; zbMATH DE number 1334211 (Why is no real title available?)
- Universality of iterated networks
- A lower bound for sorting networks based on the shuffle permutation
- Components and graph automorphisms of standard 2 � 2-switch banyan networks
- scientific article; zbMATH DE number 975342 (Why is no real title available?)
- scientific article; zbMATH DE number 3297946 (Why is no real title available?)
- On a Class of Rearrangeable Switching Networks Part I: Control Algorithm
This page was built for publication: Notes on Shuffle/Exchange-Type Switching Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3869266)