Minimizing Communication Overhead Using Pipelining for Multi-Dimensional FFT on Distributed Memory Machines.
Christophe Calvin, Frédéric Desprez · 1993
this paper we have presented different algorithms to compute the bi-dimensional FFT. These methods allow the overlapping of the communications by the computations and to reduce the number of start-up costs. We have shown that the overlap is total using coarse grain pipelining. The experiments corroborate nicely this theoretical analysis. Some other methods, using the SPMD-like programming paradigm, and other experiments are discussed in [4]. References