An Asymptotically Optimal Layout for the Shuffle-exchange Graph
Name
MIT-LCS-TM-231.pdf
Size
7.07 MB
Format
Adobe PDF
Checksum (MD5)
9942b2c9b66fda4ddc46bf321e142ab0
Author(s)
Kleitman, Daniel
Leighton, Frank Thomson
Lepley, Margaret
Miller, Gary L.
Date Issued
October 1982
Series/Report no.
MIT-LCS-TM-231
Abstract
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. In this paper, we describe an O(n^2/log^2N)-area layout for the shuffle-exchange graph on a two-dimentional grid. The layout is the first which is known to achieve Thompson's asymptotic lower bound.
Persistent DSpace Link
