Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram

DOI10.1137/0605021zbMath0543.68050OpenAlexW2098163447MaRDI QIDQ3332261

Margaret Lepley, Frank Thompson Leighton, Gary Lee Miller

Publication date: 1984

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0605021

zbMATH Keywords

graph embeddingVLSI-designshuffle-exchange grapharea- efficient layouts for VLSI-chipschip layoutcomplex plane diagramParallel computer architecturesThompson grid model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items (5)

Work-preserving emulations of shuffle-exchange networks: An analysis of the complex plane diagram ⋮ Game chromatic number of some network graphs ⋮ Graphs with the unique path property: Structure, cycles, factors, and constructions ⋮ SHUFFLE-RING: A NEW CONSTANT-DEGREE NETWORK ⋮ An asymptotically optimal layout for the shuffle-exchange graph

Cites Work

• Unnamed Item
• Unnamed Item
• The mathematics of perfect shuffles
• A layout for the shuffle-exchange network with theta(\(N^ 2\) /log N) area
• Notes on Shuffle/Exchange-Type Switching Networks
• Ultracomputers
• Parallel Processing with the Perfect Shuffle

This page was built for publication: Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram