Book chapter
Automatic Parallel Library Generation for General-Size Modular FFT Algorithms
Computer Algebra in Scientific Computing, pp 243-256
2013
Abstract
This paper presents the automatic library generation for modular FFT algorithms with arbitrary input sizes. We show how to represent the transform and its algorithms at a high abstraction level. Symbolic manipulations and code optimizations that use rewriting systems can then be systematically applied to generate a library with recursive function closure. The generated library is automatically optimized for the target computing platforms, and is intended to support modular algorithms for multivariate polynomial computations in the modpn library used by modpn. The resulting scalar and vector codes provide comparable speedup to the fixed-size code presented in [LJF10], which is an order of magnitude faster over the hand-tuned modpn library. Thread-level parallelism has also been utilized by the generated library and delivers additional speedup.
Metrics
9 Record Views
4 citations in Scopus
Details
- Title
- Automatic Parallel Library Generation for General-Size Modular FFT Algorithms
- Creators
- Lingchuan Meng - Drexel UniversityJeremy Johnson - Drexel University
- Publication Details
- Computer Algebra in Scientific Computing, pp 243-256
- Series
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing; Cham
- Resource Type
- Book chapter
- Language
- English
- Academic Unit
- Computer Science
- Scopus ID
- 2-s2.0-84885038095
- Other Identifier
- 991019170319604721