Article

Automatic Performance Tuning in the UHFFT Library

Author:

ICCS '01: Proceedings of the International Conference on Computational Sciences-Part I

Pages 71 - 80

Published: 28 May 2001 Publication History

Abstract

In this paper we describe the architecture-specific automatic performance tuning implemented in the UHFFT library. The UHFFT library is an adaptive and portable software library for fast Fourier transforms (FFT).

References

[1]

Matteo Frigo and Steven G. Johnson. The Fastest Fourier Transform in the West. Technical Report MIT-LCS-TR-728, MIT, 1997.

Crossref

Google Scholar

[2]

Charles Van Loan. Computational frameworks for the fast Fourier transform . Philadelphia:SIAM, 1992.

Crossref

Google Scholar

[3]

Richard Tolimieri, Myoung An, and Chao Lu. Algorithms for Discrete Fourier Transforms and Convolution . Springer-Verlag, New York, 1 edition, 1989.

Google Scholar

[4]

P. Duhamel and M. Vetterli. Fast Fourier Transforms: A Tutorial Review and a State of the Art. Signal Processing , 19:259-299, 1990.

Crossref

Google Scholar

[5]

J.C. Cooley and J.W. Tukey. An algorithm for the machine computation of complex fourier series. Math. Comp. , 19:291-301, 1965.

Google Scholar

[6]

I.J. Good. The interaction algorithm and practical Fourier Analysis. J. Royal Stat. Soc., Ser. B , 20:361-375, 1958.

Google Scholar

[7]

L.H. Thomas. Using a computer to solve problems in physics. In Application of Digital Computers . Ginn and Co., Boston, Mass., 1963.

Google Scholar

[8]

C. Temperton. A Note on Prime Factor FFT Algorithms. Journal of Computational Physics , 52:198-204, 1983.

Google Scholar

[9]

P. Duhamel and H. Hollmann. Split Radix FFT Algorithms. Electronic Letters , 20:14-16, 1984.

Google Scholar

[10]

C. M. Rader. Discrete Fourier transforms when the number of data samples is prime. Proceedings of the IEEE , 56:1107-1108, 1968.

Google Scholar

[11]

Matteo Frigo. A Fast Fourier Transform Compiler. Proceedings of the 1999 ACM SIGPLAN Conference on Programming Language Design and Implementation , pages 169-180, 1999.

Crossref

Google Scholar

[12]

Xavier Leroy. Le système Caml Special Light: modules et compilation efficace en Caml. Technical Report 2721, INRIA, November 1995.

Google Scholar

Cited By

View all

Ali AJohnsson LSubhlok J(2007)Adaptive computation of self sorting in-place FFTs on hierarchical memory architecturesProceedings of the Third international conference on High Performance Computing and Communications10.5555/2401945.2401990(372-383)Online publication date: 26-Sep-2007
https://dl.acm.org/doi/10.5555/2401945.2401990
Tan GXu LDai ZFeng SSun N(2007)A Study of Architectural Optimization Methods in Bioinformatics ApplicationsInternational Journal of High Performance Computing Applications10.1177/109434200707817521:3(371-384)Online publication date: 1-Aug-2007
https://dl.acm.org/doi/10.1177/1094342007078175
Ali AJohnsson LSubhlok JSmith B(2007)Scheduling FFT computation on SMP and multicore systemsProceedings of the 21st annual international conference on Supercomputing10.1145/1274971.1275011(293-301)Online publication date: 17-Jun-2007
https://dl.acm.org/doi/10.1145/1274971.1275011
Show More Cited By

Automatic Performance Tuning in the UHFFT Library
1. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis

Recommendations

Automatic Performance Tuning for Fast Fourier Transforms

In this paper we discuss architecture-specific performance tuning for fast Fourier transforms (FFTs) implemented in the UHFFT library. The UHFFT library is an adaptive and portable software library for FFTs developed by the authors. We present the ...
Automatic FFT Performance Tuning on OpenCL GPUs
ICPADS '11: Proceedings of the 2011 IEEE 17th International Conference on Parallel and Distributed Systems

Many fields of science and engineering, such as astronomy, medical imaging, seismology and spectroscopy, have been revolutionized by Fourier methods. The fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (...
Automated performance tuning
PASCO '10: Proceedings of the 4th International Workshop on Parallel and Symbolic Computation

This tutorial presents automated techniques for implementing and optimizing numeric and symbolic libraries on modern computing platforms including SSE, multicore, and GPU. Obtaining high performance requires effective use of the memory hierarchy, short ...

Comments

Information & Contributors

Information

Published In

ICCS '01: Proceedings of the International Conference on Computational Sciences-Part I

May 2001

1294 pages

ISBN:3540422323

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 28 May 2001

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ali AJohnsson LSubhlok J(2007)Adaptive computation of self sorting in-place FFTs on hierarchical memory architecturesProceedings of the Third international conference on High Performance Computing and Communications10.5555/2401945.2401990(372-383)Online publication date: 26-Sep-2007
https://dl.acm.org/doi/10.5555/2401945.2401990
Tan GXu LDai ZFeng SSun N(2007)A Study of Architectural Optimization Methods in Bioinformatics ApplicationsInternational Journal of High Performance Computing Applications10.1177/109434200707817521:3(371-384)Online publication date: 1-Aug-2007
https://dl.acm.org/doi/10.1177/1094342007078175
Ali AJohnsson LSubhlok JSmith B(2007)Scheduling FFT computation on SMP and multicore systemsProceedings of the 21st annual international conference on Supercomputing10.1145/1274971.1275011(293-301)Online publication date: 17-Jun-2007
https://dl.acm.org/doi/10.1145/1274971.1275011
Hitczenko PJohnson JHuang H(2006)Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transformTheoretical Computer Science10.1016/j.tcs.2005.09.074352:1(8-30)Online publication date: 7-Mar-2006
https://dl.acm.org/doi/10.1016/j.tcs.2005.09.074
Almagor LCooper KGrosul AHarvey TReeves SSubramanian DTorczon LWaterman T(2004)Finding effective compilation sequencesACM SIGPLAN Notices10.1145/998300.99719639:7(231-239)Online publication date: 11-Jun-2004
https://dl.acm.org/doi/10.1145/998300.997196
Almagor LCooper KGrosul AHarvey TReeves SSubramanian DTorczon LWaterman TWhalley DCytron R(2004)Finding effective compilation sequencesProceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems10.1145/997163.997196(231-239)Online publication date: 11-Jun-2004
https://dl.acm.org/doi/10.1145/997163.997196
Franchetti FKral SLorenz JPüschel MUeberhuber C(2004)Automatically tuned FFTs for bluegene/l's double FPUProceedings of the 6th international conference on High Performance Computing for Computational Science10.1007/11403937_3(23-36)Online publication date: 28-Jun-2004
https://dl.acm.org/doi/10.1007/11403937_3
Chen ZDongarra JLuszczek PRoche K(2003)Self-adapting software for numerical linear algebra library routines on clustersProceedings of the 2003 international conference on Computational science: PartIII10.5555/1762418.1762491(665-672)Online publication date: 2-Jun-2003
https://dl.acm.org/doi/10.5555/1762418.1762491
McCracken MSnavely AMalony A(2003)Performance modeling for dynamic algorithm selectionProceedings of the 2003 international conference on Computational science10.5555/1757599.1757687(749-758)Online publication date: 2-Jun-2003
https://dl.acm.org/doi/10.5555/1757599.1757687
Mirkovic DJohnsson S(2003)CODELABProceedings of the 2003 international conference on Computational science10.5555/1757599.1757685(729-738)Online publication date: 2-Jun-2003
https://dl.acm.org/doi/10.5555/1757599.1757685
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Automatic Performance Tuning for Fast Fourier Transforms

Automatic FFT Performance Tuning on OpenCL GPUs

Automated performance tuning

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations