Authors:
- Provides implementation details on FFTs for parallel computers
- Features a wealth of program examples in pseudo-code
- The first book exclusively focused on this topic
Part of the book series: High-Performance Computing Series (HPC, volume 2)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (8 chapters)
-
Front Matter
-
Back Matter
About this book
Parallel computation is becoming indispensable in solving the large-scale problems increasingly arising in a wide range of applications. The performance of parallel supercomputers is steadily improving, and it is expected that a massively parallel system with hundreds of thousands of compute nodes equipped with multi-core processors and accelerators will be available in the near future. Accordingly, the book also provides up-to-date computational techniquesrelevant to the FFT in state-of-the-art parallel computers.
Following the introductory chapter, Chapter 2 introduces readers to the DFT and the basic idea of the FFT. Chapter 3 explains mixed-radix FFT algorithms, while Chapter 4 describes split-radix FFT algorithms. Chapter 5 explains multi-dimensional FFT algorithms, Chapter 6 presents high-performance FFT algorithms, and Chapter 7 addresses parallel FFT algorithms for shared-memory parallel computers. In closing, Chapter 8 describes parallel FFT algorithms for distributed-memory parallel computers.
Reviews
Authors and Affiliations
-
University of Tsukuba , Tsukuba, Japan
Daisuke Takahashi
About the author
Bibliographic Information
Book Title: Fast Fourier Transform Algorithms for Parallel Computers
Authors: Daisuke Takahashi
Series Title: High-Performance Computing Series
DOI: https://doi.org/10.1007/978-981-13-9965-7
Publisher: Springer Singapore
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Singapore Pte Ltd. 2019
Hardcover ISBN: 978-981-13-9964-0Published: 17 October 2019
Softcover ISBN: 978-981-13-9967-1Published: 17 October 2020
eBook ISBN: 978-981-13-9965-7Published: 05 October 2019
Series ISSN: 2662-3420
Series E-ISSN: 2662-3439
Edition Number: 1
Number of Pages: IX, 114
Number of Illustrations: 32 b/w illustrations
Topics: Algorithm Analysis and Problem Complexity, Algorithms, Mathematical and Computational Engineering