An asymptotically optimal layout for the shuffle-exchange graph

DOI10.1016/0022-0000(83)90005-3zbMath0509.68061OpenAlexW2044646290MaRDI QIDQ1838315

Margaret Lepley, Daniel J. Kleitman, Frank Thompson Leighton, Gary Lee Miller

Publication date: 1983

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(83)90005-3

zbMATH Keywords

parallel computationshuffle-exchange computer

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Long edges in the layouts of shuffle-exchange and cube-connected cycles graphs, Representations of graphs and networks (coding, layouts and embeddings), DESIGN OF A PARALLEL INTERCONNECT BASED ON COMMUNICATION PATTERN CONSIDERATIONS

Cites Work

• String overlaps, pattern matching, and nontransitive games
• Periods in strings
• A layout for the shuffle-exchange network with theta(\(N^ 2\) /log N) area
• Efficient detection of determinacy races in cilk programs
• Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram
• Three-Dimensional Circuit Layouts
• Notes on Shuffle/Exchange-Type Switching Networks
• Ultracomputers
• New lower bound techniques for VLSI
• Optimal three-dimensional VLSI layouts
• Parallel Processing with the Perfect Shuffle