Asymptotically optimal layout for the shuffle-exchange graph
Journal Article
·
· J. Comput. Syst. Sci.; (United States)
The shuffle-exchange graph is one of the best structures known for parallel computation. Among other things, a shuffle-exchange computer can be used to compute discrete Fourier transforms, multiply matrices, evaluate polynomials, perform permutations, and sort lists. The algorithms needed for these operations are quite simple and many require no more than logarithmic time and constant space per processor. An o(n/sup 2//log/sup 2/ n)-area layout for the shuffle-exchange graph on a two-dimensional grid is described. The layout is the first which is known to achieve Thompson's asymptotic lower bound (1979). 23 references.
- Research Organization:
- MIT, Cambridge, MA
- OSTI ID:
- 5084149
- Journal Information:
- J. Comput. Syst. Sci.; (United States), Journal Name: J. Comput. Syst. Sci.; (United States) Vol. 3; ISSN JCSSD
- Country of Publication:
- United States
- Language:
- English
Similar Records
Layouts for the shuffle-exchange graph based on the complex plane diagram
Layouts for the shuffle-exchange graph and lower bound techniques for VLSI
Hypercube and shuffle-exchange algorithms for image-component labeling. Technical report
Technical Report
·
Tue Jun 01 00:00:00 EDT 1982
·
OSTI ID:6730273
Layouts for the shuffle-exchange graph and lower bound techniques for VLSI
Technical Report
·
Sun Aug 01 00:00:00 EDT 1982
·
OSTI ID:6745123
Hypercube and shuffle-exchange algorithms for image-component labeling. Technical report
Technical Report
·
Tue Mar 31 23:00:00 EST 1987
·
OSTI ID:6601250