FFT program generation for shared memory: SMP and multicore

Proceedings of the 2006 ACM/IEEE Conference on Supercomputing, SC'06

Volumn , Issue , 2006, Pages

  Franchetti, Franz ^a   Voronenko, Yevgen ^a   Püschel, Markus ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Automatic parallelization; Chip multiprocessor; Fast fourier transform; Multicore; Shared memory

Indexed keywords

AUTOMATIC PARALLELIZATION; CHIP MULTIPROCESSORS; CPU FREQUENCY SCALING; SHARED MEMORY;

ALGORITHMS; CODES (SYMBOLS); DATA STORAGE EQUIPMENT; MICROPROCESSOR CHIPS; OPTIMIZATION; PROGRAM PROCESSORS;

FAST FOURIER TRANSFORMS;

EID: 34548244593     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1188455.1188575     Document Type: Conference Paper

References (31)

1. AL NA'MNEH, R. A., PAN, W. D., AND ADHAMI, R. 2005. Communication efficient adaptive matrix transpose algorithm for FFT on symmetric multiprocessors. In Proc. Southeastern Symposium on System Theory (SSST), 312-315.
2. AL NA'MNEH, R. A., PAN, W. D., AND ADHAMI, R. 2005. Parallel implementation of 1-D fast Fourier transform without inter-processor communications. In Proc. Southeastern Symposium on System Theory (SSST), 307-311.
3. BAILEY, D. H. 1990. FFTs in external or hierarchical memory. J. Supercomputing 4, 23-35.
4. BANERJEE, U., EIGENMANN, R., NICOLAU, A., AND PADUA, D. A. 1993. Automatic program parallelization. Proceedings of the IEEE 81, 2, 211-243.
5. BIENTINESI, P., GUNNELS, J. A., MYERS, M. E., QUINTANA-ORTI, E., AND VAN DE GEIJN, R. 2005. The science of deriving dense linear algebra algorithms. TOMS 31, 1 (March), 1-26.
6. CHANDRA, R., MENON, R., DAGUM, L., KOHR, D., MAYDAN, D., AND MCDONALD, J. 2000. Parallel Programming in OpenMP. Elsevier.
7. DEMMEL, J., DONGARRA, J., EIJKHOUT, V., FUENTES, E., PETITET, A., VUDUC, R., WHALEY, C., AND YELICK, K. 2005. Self adapting linear algebra algorithms and software. Proceedings of the IEEE 93, 2, 293-312. Special issue on "Program Generation, Optimization, and Adaptation".
8. DERSHOWITZ, N., AND PLAISTED, D. A. 2001. Rewriting. In Handbook of Automated Reasoning, A. Robinson and A. Voronkov, Eds., vol. 1. Elsevier, ch. 9, 535-610.
9. FRANCHETTI, F., AND PÜSCHEL, M. 2002. A SIMD vec-torizing compiler for digital signal processing algorithms. In Proc. IEEE Int'l Parallel and Distributed Processing Symposium (IPDPS), 20-26.
10. FRANCHETTI, F., AND PÜSCHEL, M. 2003. Short vector code generation for the discrete Fourier transform. In Proc. IEEE Int'l Parallel and Distributed Processing Symposium (IPDPS), 58-67.
11. FRANCHETTI, F., VORONENKO, Y., AND PÜSCHEL, M. 2005. Loop merging for signal transforms. In Proc. Programming Language Design and Implementation (PLDI), 315-326.
12. FRANCHETTI, F., VORONENKO, Y., AND PÜSCHEL, M. 2006. A rewriting system for the vectorization of signal transforms. In Proc. High Performance Computing for Computational Science (VECPAR).
13. FRIGO, M., AND JOHNSON, S. G. 2005. The design and implementation of FFTW3. Proceedings of the IEEE 93, 2, 216-231. Special issue on "Program Generation, Optimization, and Adaptation".
14. GATLIN, K. S., AND CARTER, L. 1999. Architecture-cognizant divide and conquer algorithms. In Proc. Supercomputing (CDROM).
15. GUNNELS, J. A., GUSTAVSON, F. G., HENRY, G. M., AND VAN DE GEIJN, R. A. 2001. FLAME: Formal linear algebra methods environment. TOMS 27, 4 (December), 422-455.
16. HIRANANDANI, S., KENNEDY, K., AND TSENG, C.W. 1992. Compiling Fortran D for MIMD distributedmemory machines. Commun. ACM 35, 8, 66-80.
17. IM, E.-J., YELICK, K., AND VUDUC, R. 2004. Sparsity: Optimization framework for sparse matrix kernels. Int'l J. High Performance Computing Applications 18,1.
18. JOHNSON, J. R., JOHNSON, R. W., RODRIGUEZ, D., AND TOLIMIERI, R. 1990. A methodology for designing, modifying, and implementing FFT algorithms on various architectures. Circuits Systems Signal Processing 9, 449-500.
19. MCKELLAR, A. C., AND E. G. COFFMAN, J. 1969. Organizing matrices and matrix operations for paged memory systems. CommunicationsACM 12, 3, 153-165.
20. NORTON, A., AND SILBERGER, A. J. 1987. Parallelization and performance analysis of the Cooley-Tukey FFT algorithm for shared-memory architectures. IEEE Trans. Comput.36, 5, 581-591.
21. PÜSCHEL, M., MOURA, J. M. F., JOHNSON, J., PADUA, D., VELOSO, M., SINGER, B. W., XIONG, J., FRANCHETTI, F., GAČIČ, A., VORONENKO, Y., CHEN, K., JOHNSON, R. W., AND RIZZOLO, N. 2005. SPIRAL: Code generation for DSP transforms. Proc. of the IEEE 93, 2, 232-275. Special issue on Program Generation, Optimization, and Adaptation.
22. SCHWARZTRAUBER, P. N. 1987. Multiprocessor FFTs. Parallel Computing 5, 197-210.
23. SINGER, B., AND VELOSO, M. 2001. Stochastic search for signal processing algorithm optimization. In Proc. Supercomputing.
24. TAKAHASHI, D., SATO, M., AND BOKU, T. 2003. An OpenMP implementation of parallel FFT and its performance on IA-64 processors. Lecture Notes in Computer Science 2716, 99-108.
25. TAKAHASHI, D. 2002. A blocking algorithm for parallel 1-D FFT on shared-memory parallel computers. Lecture Notes in Computer Science 2367, 380-389.
26. VAN LOAN, C. 1992. Computational Framework of the Fast Fourier Transform. SIAM.
27. WHALEY, R. C., PETITET, A., AND DONGARRA, J. J. 2001. Automated empirical optimization of software and the ATLAS project. Parallel Computing 27, 1-2, 3-35.
28. WOLF, M. E., AND LAM, M. S. 1991. A data locality optimizing algorithm. In Proc. Programming Language Design and Implementation (PLDI), 30-44.
29. WOLFE, M. 1996. High performance compilers for parallel computing. Addison-Wesley, Redwood City, CA.
30. XIONG, J., JOHNSON, J., JOHNSON, R., AND PADUA, D. 2001. SPL: A language and compiler for DSP algorithms. In Proc. Programming Language Design and Implementation (PLDI), 298-308.
31. ZIMA, H., AND CHAPMAN, B. 1990. Supercompilers for parallel and vector computers. ACM Press, New York.