A Layout for the Shuffle-Exchange Network with O(N2/log3/2N) Area

Authors:
D. Steinberg;M. Rodeh
Affiliations:
Department of Applied Mathematics, The Weizmann Institute;-
Venue:
IEEE Transactions on Computers
Year:
1981

Citing 8
Cited 0

Ultracomputers

ACM Transactions on Programming Languages and Systems (TOPLAS)
Area-time complexity for VLSI

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A complexity theory for VLSI

A complexity theory for VLSI
Parallel Processing with the Perfect Shuffle

IEEE Transactions on Computers
Notes on Shuffle/Exchange-Type Switching Networks

IEEE Transactions on Computers
Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange Network

IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor

IEEE Transactions on Computers
The cube-connected-cycles: A versatile network for parallel computation

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	14.98

Visualization

Abstract

A layout for the shuffle-exchange network with O(N2/log3/2N) area is described. The layout combines ideas proposed by Thompson, Hoey, and Leiseron, and Preparata and Vuillemin. An interesting feature of the layout is that both the shuffle and the exchange edges have the same average length.