### 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/2^{d+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 language | English (US) |
---|---|

Title of host publication | Proc Supercomput 91 |

Place of Publication | Piscataway, NJ, United States |

Publisher | Publ by IEEE |

Pages | 754-763 |

Number of pages | 10 |

ISBN (Print) | 0818621583 |

State | Published - 1991 |

Event | Proceedings of Supercomputing '91 - Albuquerque, NM, USA Duration: Nov 18 1991 → Nov 22 1991 |

### Other

Other | Proceedings of Supercomputing '91 |
---|---|

City | Albuquerque, NM, USA |

Period | 11/18/91 → 11/22/91 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Proc Supercomput 91*(pp. 754-763). Piscataway, NJ, United States: Publ by IEEE.

**Parallel power-of-two FFTs on hypercubes.** / Woo, Mahn ling; Renaut, Rosemary.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proc Supercomput 91.*Publ by IEEE, Piscataway, NJ, United States, pp. 754-763, Proceedings of Supercomputing '91, Albuquerque, NM, USA, 11/18/91.

}

TY - GEN

T1 - Parallel power-of-two FFTs on hypercubes

AU - Woo, Mahn ling

AU - Renaut, Rosemary

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0026275675&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026275675&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0026275675

SN - 0818621583

SP - 754

EP - 763

BT - Proc Supercomput 91

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -