A study of the communication cost of the FFT on torus multicomputers
Document typeConference report
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Rights accessOpen Access
The computation of a one-dimensional FFT on a c-dimensional torus multicomputer is analyzed. Different approaches are proposed which differ in the way they use the interconnection network. The first approach is based on the multidimensional index mapping technique for the FFT computation. The second approach starts from a hypercube algorithm and then embeds the hypercube onto the torus. The third approach reduces the communication cost of the hypercube algorithm by pipelining the communication operations. A novel methodology to pipeline the communication operations on a torus is proposed. Analytical models are presented to compare the different approaches. This comparison study shows that the best approach depends on the number of dimensions of the torus and the communication start-up and transfer times. The analytical models allow us to select the most efficient approach for the available machine.
CitationDíaz De Cerio, L., Valero-García, M, González, A. A study of the communication cost of the FFT on torus multicomputers. A: IEEE International Conference on Algorithms and Architectures for Parallel Processing. "IEEE First International Conference on Algorithms and Architectures for Parallel Processing". Brisbane: Institute of Electrical and Electronics Engineers (IEEE), 1995, p. 131-140.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder