An asymptotically optimal layout for the shuffle—exchange graph

AbstractThe 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(N2log2 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