Multiprocessor FFTs

@article{Swarztrauber1987MultiprocessorF,
  title={Multiprocessor FFTs},
  author={Paul N. Swarztrauber},
  journal={Parallel Computing},
  year={1987},
  volume={5},
  pages={197-210}
}
Several multiprocessor FFTs are developed in this paper for both vector multiprocessors with shared memory and the hypercube. Two FFTs for vector multiprocessors are given that compute an ordered transform and have a stride of one except for a single "link" step. Since multiple FFTs provide additional options for both vectorization and distribution we show that a single FFT can be performed in terms of two multiple FFTs and implement the algorithm on an Alliant FX/8 multiprocessor. For the… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 83 CITATIONS

FILTER CITATIONS BY YEAR

1988
2019

CITATION STATISTICS

  • 14 Highly Influenced Citations

  • Averaged 1 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

Fast Fourier transforms and Poisson solvers on the Cray-1

  • C. Temperton
  • Infotech State of the Art Report: Supercomputers…
  • 1979
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…