Conference proceeding
Spiral-generated modular FFT algorithms
Proceedings of the 4th International Workshop on parallel and symbolic computation, pp 169-170
21 Jul 2010
Abstract
This paper presents an extension of the Spiral system to automatically generate and optimize FFT algorithms for the discrete Fourier transform over finite fields. The generated code is intended to support modular algorithms for multivariate polynomial computations in the modpn library used by Maple. The resulting code provides an order of magnitude speedup over the original implementations in the modpn library, and the Spiral system provides the ability to automatically tune the FFT code to different computing platforms.
Metrics
14 Record Views
19 citations in Scopus
Details
- Title
- Spiral-generated modular FFT algorithms
- Creators
- Lingchuan Meng - Drexel UniversityYevgen Voronenko - Carnegie Mellon UniversityJeremy Johnson - Drexel UniversityMarc Moreno MazaFranz Franchetti - Carnegie Mellon UniversityYuzhen Xie - Western University
- Publication Details
- Proceedings of the 4th International Workshop on parallel and symbolic computation, pp 169-170
- Conference
- 4th International Workshop on parallel and symbolic computation, 4th
- Series
- PASCO '10
- Publisher
- Association for Computing Machinery (ACM)
- Number of pages
- 1
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Computer Science
- Scopus ID
- 2-s2.0-77956235026
- Other Identifier
- 991019173910404721