ACM Home Page
Please provide us with feedback. Feedback
An adaptive software library for fast Fourier transforms
Full text PdfPdf (1.15 MB)
Source International Conference on Supercomputing archive
Proceedings of the 14th international conference on Supercomputing table of contents
Santa Fe, New Mexico, United States
Pages: 215 - 224  
Year of Publication: 2000
ISBN:1-58113-270-0
Authors
Dragan Mirković  Department of Computer Science, University of Houston, Houston, TX
Rishad Mahasoom  Department of Computer Science, University of Houston, Houston, TX
Lennart Johnsson  Department of Computer Science, University of Houston, Houston, TX
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 19,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/335231.335252
What is a DOI?

ABSTRACT

In this paper we present an adaptive and portable software library for the fast Fourier transform (FFT). The library consists of a number of composable blocks of code called codelets, each computing a part of the transform. The actual FFT algorithm used by the code is determined at run-time by selecting the fastest strategy among all possible strategies, given available codelets, for a given transform size. We also present an efficient automatic method of generating the library modules by using a special-purpose compiler. The code generator is written in C and it generates a library of C codelets. The code generator is shown to be flexible and extensible and the entire library can be generated in a matter of seconds. We have evaluated the library for performance on the IBM-SP2, SG1-2000, HP-Exemplar and Intel Pentium systems. We use the results from these evaluations to build performance models for the FFT library on different platforms. The library is shown to be portable, adaptive and efficient.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J.C. Cooley and J.W. Tukey. An algorithm for the machine computation of complex fourier series. Math. Comp., 19:291-301, 1965.
 
2
 
3
 
4
 
5
C. Temperton. A Note on Prime Factor FFT Algorithms. Journal of Computational Physics, 52:198-204, 1983.
 
6
C. M. Rader. Discrete fourier transforms when the number of data samples is prime. Proceedings of the IEEE, 56:1107-1108, 1968.
 
7
P. Duhamel and H. Hollmann. Split Radix FFT Algorithms. Electronic Letters, 20:14-16, 1984.
 
8
MIPS RIO000 Microprocessor. Users Manual. MIPS Technologies, Inc., 1996.
 
9
IBM. RS6000 Technical specification. http://www.rs6OOO.ibm.eom/, 1999.
 
10
Exemplar Programming Guide. Hewlett-Packaxd, Inc., 1997.
 
11
Intel Architecture Optimization. Reference Manual. Intel Corporation, 1999.
 
12
Rudolf Berrendorf and Heinz Ziegler. PCL: The Performance Counter Library. http://www.fz-juelich.de/zam/PCL/, 1999.


Collaborative Colleagues:
Dragan Mirković: colleagues
Rishad Mahasoom: colleagues
Lennart Johnsson: colleagues

Peer to Peer - Readers of this Article have also read: