A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Ordered fast fourier transforms on a massively parallel hypercube multiprocessor
1991
Journal of Parallel and Distributed Computing
We examine design alternatives for ordered FFT algorithms on massively parallel hypercube multiprocessors such as the Connection Machine. Particular emphasis is placed on reducing communication which is known to dominate the overall computing time. To this end we combine the order and computational phases of the FFT and also use sequence to processor maps that reduce communication. The class of ordered transforms is expanded to include any FFT in which the order of the transform is the same as
doi:10.1016/0743-7315(91)90028-8
fatcat:vf3icvow4vgalkfha3co35wb3e