Discrete Fourier transform on multicore: A review of optimizations necessary for good multicore performance

IEEE Signal Processing Magazine

Volumn 26, Issue 6, 2009, Pages 90-102

  Franchetti, Franz ^a   Puschel, Markus ^a   Voronenko, Yevgen ^a   Chellappa, Srinivas ^a   Moura, José M F ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Discrete Fourier transforms; Multicore processing; Optimization; Signal processing algorithms

Indexed keywords

COMPUTER GRAPHICS; GRAPHICS PROCESSING UNIT; MULTICORE PROGRAMMING; OPTIMIZATION; PROGRAM PROCESSORS; SIGNAL PROCESSING;

ALGORITHMIC TRANSFORMATION; HARDWARE PARAMETERS; KRONECKER PRODUCT; MEMORY HIERARCHY OPTIMIZATIONS; MULTI-CORE PROCESSING; MULTI-CORE SYSTEMS; PERFORMANCE OPTIMIZATIONS; SIGNAL PROCESSING ALGORITHMS;

DISCRETE FOURIER TRANSFORMS;

EID: 85032751664     PISSN: 10535888     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2009.934155     Document Type: Review

References (51)

1. G. Blake, R. G. Dreslinski, and T. Mudge, "A survey of multicore architectures," IEEE Signal Processing Mag., vol. 26, no. 6, pp. 26-37, 2009.
2. W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling, Numerical Recipes in C: The Art of Scientific Computing, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 1992.
3. M. Püschel, J. M. F. Moura, J. Johnson, D. Padua, M. Veloso, B. W. Singer, J. Xiong, F. Franchetti, A. Gačić, Y. Voronenko, K. Chen, R. W. Johnson, and N. Rizzolo, "SPIRAL: Code generation for DSP transforms," Proc. IEEE (Special Issue on Program Generation, Optimization, and Adaptation), vol. 93, no. 2, pp. 232-275, 2005.
4. Y. Voronenko, F. de Mesmay, and M. Püschel, "Computer generation of general size linear transform libraries," in Proc. Code Generation and Optimization (CGO), 2009, pp. 102-113.
5. F. Franchetti, Y. Voronenko, and M. Püschel, "FFT program generation for shared memory: SMP and multicore," in Proc. Supercomputing (SC) 2006, p. 51.
6. M. Frigo and S. G. Johnson, "The design and implementation of FFTW3," Proc. IEEE (Special Issue on Program Generation, Optimization, and Adaptation), vol. 93, no. 2, pp. 216-231, 2005.
7. M. Frigo, "A fast Fourier transform compiler," in Proc. Programming Language Design and Implementation (PLDI), 1999, pp. 169-180.
8. M. Frigo and S. G. Johnson, FFTW 3.2 [Online]. Available: Www.fftw.org
9. D. A. Bader and V. Agarwal, "FFTC: Fastest Fourier transform for the IBM cell broadband engine," in Proc. Int. Conf. High Performance Computing (HiPC), 2007, pp. 172-184.
10. N. K. Govindaraju, B. Lloyd, Y. Dotsenko, B. Smith, and J. Manferdelli, "High performance discrete Fourier transforms on graphics processors," in Proc. Supercomputing (SC), 2008, pp. 1-12.
11. C. Van Loan, Computational Framework of the Fast Fourier Transform Philadelphia, PA: SIAM, 1992.
12. R. Tolimieri, M. An, and C. Lu, Algorithms for Discrete Fourier Transforms and Convolution, 2nd ed. New York: Springer-Verlag, 1997.
13. M. Püschel, Spiral Web site [Online]. Available: Www.spiral.net
14. J. Johnson, R. W. Johnson, D. Rodriguez, and R. Tolimieri, "A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures," IEEE Trans. Circuits Syst., vol. 9, no. 4, pp. 449-500, 1990.
15. A. Norton and A. J. Silberger, "Parallelization and performance analysis of the Cooley-Tukey FFT algorithm for shared-memory architectures," IEEE Trans. Comput., vol. 36, no. 5, pp. 581-591, 1987.
16. M. Hegland, "Block algorithms for FFTs on vector and parallel computer," in Parallel Computing: Trends and Applications. Amsterdam, The Netherlands: Elsevier, 1994, pp. 129-136.
17. D. H. Bailey, "FFTs in external or hierarchical memory," J. Supercomput., vol. 4, no. 1, pp. 23-35, Mar. 1990.
18. D. B. Harris, J. H. Mc Clellan, D. S. K. Chan, and H. W. Schuessler, "Vector radix fast Fourier transform," in Proc. Int. Conf. Acoustics, Speech, and Signal Processing (ICASSP), 1977, pp. 548-551.
19. J. W. Cooley and J. W. Tukey, "An algorithm for the machine calculation of complex Fourier series," Math. Comput., vol. 19, pp. 297-301, Apr. 1965.
20. M. C. Pease, "An adaptation of the fast Fourier transform for parallel processing," J. ACM, vol. 15, no. 2, pp. 252-264, Apr. 1968.
21. P. N. Schwarztrauber, "Multiprocessor FFTs," Parallel Comput., vol. 5, pp. 197-210, July 1987.
22. Intel Corp., Intel integrated performance primitives (ipp) 6.0 [Online]. Available: http://software.intel.com/en-us/intel-ipp
23. J. Xiong, J. Johnson, R. Johnson, and D. Padua, "SPL: A language and compiler for DSP algorithms," in Proc. Programming Language Design and Implementation (PLDI), 2001, pp. 298-308.
24. I. W. Selesnick and C. S. Burrus, "Automatic generation of prime length FFT programs," IEEE Trans. Signal Processing, vol. 44, no. 1, pp. 14-24, 1996.
25. F. Franchetti, Y. Voronenko, and M. Püschel, "Loop merging for signal transforms," in Proc. Programming Language Design and Implementation (PLDI), 2005, pp. 315-326.
26. D. Mirković and S. L. Johnsson, "Automatic performance tuning in the UHFFT library," in Proc. Int. Conf. Computational Science (ICCS) (Lecture Notes in Computer Science, vol. 2073). New York: Springer-Verlag, 2001, pp. 71-80.
27. D. Takahashi, "An implementation of parallel 1-D FFT using SSE3 instructions on dual-core processors," in Proc. Int. Workshop State-of-the-Art in Scientific and Parallel Computing (PARA), 2006, pp. 1178-1187.
28. Y. Voronenko, "Library generation for linear transforms," Ph.D. dissertation, Elect. Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, 2008.
29. S. Chellappa, F. Franchetti, and M. Püschel, "How to write fast numerical code: A small introduction," in Proc. Summer School on Generative and Transformational Techniques in Software Engineering (GTTSE) (Lecture Notes in Computer Science, vol. 5235). Berlin: Springer-Verlag, 2008, pp. 196-259.
30. J. R. Johnson, R. W. Johnson, D. Rodriguez, and R. Tolimieri, "A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures," IEEE Trans. Circuits, Syst., Signal Processing, vol. 9, no. 4, pp. 449-500, 1990.
31. A. Ali, L. Johnsson, and J. Subhlok, "Scheduling FFT computation on SMP and multicore systems," in Proc. Int. Conf. Supercomputing (ICS), 2007, pp. 293-301.
32. OpenMP. (1998). OpenMP C and C++ application program interface, version 1.0 [Online]. Available: Www.openmp.org
33. B. Gallmeister, POSIX.4. Sebastopol, CA: O'Reilly, 1994.
34. F. Franchetti and M. Püschel, "Generating SIMD vectorized permutations," in Proc. Int. Conf. Compiler Construction (CC) (Lecture Notes in Computer Science, vol. 4959). Berlin: Springer-Verlag, 2008, pp. 116-131.
35. F. Franchetti and M. Püschel, "Short vector code generation for the discrete Fourier transform," in Proc. IEEE Int. Parallel and Distributed Processing Symp. (IPDPS), 2003, pp. 58-67.
36. F. Franchetti and M. Püschel, "A SIMD vectorizing compiler for digital signal processing algorithms," in Proc. IEEE Int. Parallel and Distributed Processing Symp. (IPDPS), 2002, pp. 20-26.
37. F. Franchetti, Y. Voronenko, and M. Püschel, "A rewriting system for the vectorization of signal transforms," in Proc. High Performance Computing for Computational Science (VECPAR), 2006, pp. 363-377.
38. P. A. Milder, F. Franchetti, J. C. Hoe, and M. Püschel, "Formal datapath representation and manipulation for implementing DSP transforms," in Proc. Design Automation Conf. (DAC), 2008, pp. 385-390.
39. A. Snavely, L. Carter, J. Boisseau, A. Majumdar, K. S. Gatlin, N. Mitchell, J. Feo, and B. Koblenz, "Multi-processor performance on the Tera MTA," in Proc. Supercomputing (SC), 1998, pp. 1-8.
40. K. Moreland and E. Angel, "The FFT on a GPU," in Proc. ACM SIGGRAPH/ EUROGRAPHICS Conf. Graphics Hardware, 2003, pp. 112-119.
41. N. K. Govindaraju and D. Manocha, "Cache-efficient numerical algorithms using graphics hardware," Parallel Comput., vol. 33, no. 10-11, pp. 663-684, 2007.
42. A. Nukada, Y. Ogata, T. Endo, and S. Matsuoka, "Bandwidth intensive 3-d FFT kernel for GPUs using CUDA," in Proc. Supercomputing (SC , 2008, pp. 1-11.
43. Nvidia Corp., Nvidia CUDA [Online]. Available: Www.nvidia.com/cuda
44. Khronos Group, OpenCL [Online]. Available: Www.khronos.org/opencl/
45. S. Chellappa, F. Franchetti, and M. Püschel, "Computer generation of fast Fourier transforms for the cell broadband engine," in Proc. Int. Conf. Supercomputing (ICS), 2009, pp. 26-35.
46. A. C. Chow, G. C. Fossum, and D. A. Brokenshire, "A programming example: Large FFT on the cell broadband engine," IBM, Tech. Rep., May 2005 [Online]. Available: https://www-01.ibm.com/chips/techlib/ techlib.nsf/techdocs/0AA2394A505EF0FB872570AB005BF0F1/$file/ GSPx_FFT_paper_legal_0115.pdf
47. J. Greene and R. Cooper, "A parallel 64K complex FFT algorithm for the IBM/ Sony/Toshiba cell broadband engine processor," in Proc. Global Signal Processing Expo (GSPx), 2005.
48. L. Cico, R. Cooper, and J. Greene, "Performance and programmability of the IBM/Sony/Toshiba cell broadband engine processor," in Proc. (EDGE) Workshop, 2006.
49. P. Bientinesi, N. Pitsianis, and X. Sun, "Multi-dimensional array operations for signal processing algorithms," in Proc. Int. Workshop State-of-the-Art in Scientific and Parallel Computing (PARA), 2008.
50. 4DSP Inc., 4DSP [Online]. Available: Www.4dsp.com/fft.htm
51. Dillon Engineering, Dillon FFT [Online]. Available: Www.dilloneng.com/ fft_ip