Parallel power-of-two FFTs on hypercubes

Mahn ling Woo, Rosemary Renaut

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Theoretical analysis of ordered power-of-two fast Fourier transforms (PO2FFTs) demonstrates that the most efficient algorithms for hypercube architectures may not always use nearest-neighbor communication. It is shown that an ordered PO2FFT can be obtained with just d interprocessor communications for any r if the restriction that all communications are distance one is removed. The two interprocessor communications requirements of this algorithm are determined. Packets of size N/2d+1 are transmitted in both of the ordered PO2FFT algorithms. The time complexity of both the distance one and the distance two algorithms is discussed.

Original languageEnglish (US)
Title of host publicationProc Supercomput 91
PublisherPubl by IEEE
Pages754-763
Number of pages10
ISBN (Print)0818621583, 9780818621581
DOIs
StatePublished - 1991
EventProceedings of Supercomputing '91 - Albuquerque, NM, USA
Duration: Nov 18 1991Nov 22 1991

Publication series

NameProc Supercomput 91

Other

OtherProceedings of Supercomputing '91
CityAlbuquerque, NM, USA
Period11/18/9111/22/91

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Parallel power-of-two FFTs on hypercubes'. Together they form a unique fingerprint.

  • Cite this

    Woo, M. L., & Renaut, R. (1991). Parallel power-of-two FFTs on hypercubes. In Proc Supercomput 91 (pp. 754-763). (Proc Supercomput 91). Publ by IEEE. https://doi.org/10.1145/125826.126178