AccFFT: A library for distributed-memory 3-D FFT on CPU and GPU architectures. AccFFT is a new massively parallel FFT library for CPU/GPU architectures. FFT is a fundamental algorithm originally developed by Cooley-Tukey. Many different libraries have been developed using this simple yet briliant algorithm. In recent years, the need to perform distributed, parallel computational has created a need for a fast parallel FFT library that can scale to thousands of processors. AccFFT is specifically designed with the goal of achieving maximum performance and scalability for both CPUs and GPUs. It uses a series of novel algorithms to reduce communication costs inherent in distributed FFTs.
Keywords for this software
References in zbMATH (referenced in 6 articles )
Showing results 1 to 6 of 6.
- Scheufele, Klaudius; Subramanian, Shashank; Mang, Andreas; Biros, George; Mehl, Miriam: Image-driven biophysical tumor growth model calibration (2020)
- Subramanian, Shashank; Scheufele, Klaudius; Mehl, Miriam; Biros, George: Where did the tumor start? An inverse solver with sparse localization for tumor growth models (2020)
- Jaber J. Hasbestan, Inanc Senocak: PittPack: An Open-Source Poisson’s Equation Solver for Extreme-Scale Computing with Accelerators (2019) arXiv
- Mang, Andreas; Gholami, Amir; Davatzikos, Christos; Biros, George: CLAIRE: a distributed-memory solver for constrained large deformation diffeomorphic image registration (2019)
- Mang, Andreas; Gholami, Amir; Davatzikos, Christos; Biros, George: PDE-constrained optimization in medical image analysis (2018)
- Gholami, Amir; Malhotra, Dhairya; Sundar, Hari; Biros, George: FFT, FMM, or multigrid? A comparative study of state-of-the-art Poisson solvers for uniform and nonuniform grids in the unit cube (2016)
Further publications can be found at: http://accfft.org/publications/