A layout for the shuffle-exchange network with theta(\(N^ 2\) /log N) area

DOI10.1016/0020-0190(81)90008-9zbMath0474.68032OpenAlexW2058391907MaRDI QIDQ1158955

S. H. Smith

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90008-9

zbMATH Keywords

VLSIpermutation networkparallel processor interconnection schemata

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Theory of operating systems (68N25)

Related Items (2)

Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram ⋮ An asymptotically optimal layout for the shuffle-exchange graph

Cites Work

• Notes on Shuffle/Exchange-Type Switching Networks
• A Self-Routing Benes Network and Parallel Permutation Algorithms
• Ultracomputers
• Access and Alignment of Data in an Array Processor
• Parallel Processing with the Perfect Shuffle

This page was built for publication: A layout for the shuffle-exchange network with theta(\(N^ 2\) /log N) area