首页/论文/2002.04896

arXiv 2002.048962020-02cs.DCcs.PF

CROFT: A scalable three-dimensional parallel Fast Fourier Transform (FFT) implementation for High Performance Clusters

Vivek Gavane, Supriya Prabhugawankar, Shivam Garg, Archana Achalere, Rajendra Joshi

备注：: 28 Pages, 15 Figures

英文摘要：

The FFT of three-dimensional (3D) input data is an important computational kernel of numerical simulations and is widely used in High Performance Computing (HPC) codes running on a large number of processors. Performance of many scientific applications such as Molecular Dynamic simulations depends on the underlying 3D parallel FFT library being used. In this paper, we present C-DACs three-dimensional Fast Fourier Transform (CROFT) library which implements three-dimensional parallel FFT using pencil decomposition. To exploit the hyperthreading capabilities of processor cores without affecting performance, CROFT is designed to use multithreading along with MPI. CROFT implementation has an innovative feature of overlapping compute and memory-I/O with MPI communication using multithreading. As opposed to other 3D FFT implementations, CROFT uses only two threads where one thread is dedicated for communication so that it can be effectively overlapped with computations. Thus, depending on the number of processes used, CROFT achieves performance improvement of about 51% to 42% as compared to FFTW3 library.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

TurboFNO：GPU上融合FFT-GEMM-iFFT的高性能傅里叶神经算子

TurboFNO: High-Performance Fourier Neural Operator with Fused FFT-GEMM-iFFT on GPU

针对傅里叶神经算子（FNO）因阶段分离导致的性能瓶颈，提出TurboFNO，通过融合FFT-GEMM-iFFT为单GPU内核并优化内存利用，在NVIDIA A100上性能较现有方案提升高达150%。

2025-04-16cs.DC

Benchmarking a Proof-of-Concept Performance Portable SYCL-based Fast Fourier Transformation Library

In this paper, we present an early version of a SYCL-based FFT library, capable of running on all major vendor hardware, including CPUs and GPUs from AMD, ARM, Intel and NVIDIA. Although preliminary, the aim of this work is to seed further developments for a rich set of features for calculating FFTs. It has the advantage over existing portable FFT libraries in that it is single-source, and therefore removes the complexities that arise due to abundant use of pre-process macros and auto-generated kernels to target different architectures. We exercise two SYCL-enabled compilers, Codeplay ComputeC…

2022-03-17cs.DCcs.MScs.PF

Novel Model-based Methods for Performance Optimization of Multithreaded 2D Discrete Fourier Transform on Multicore Processors

In this paper, we use multithreaded fast Fourier transforms provided in three highly optimized packages, FFTW-2.1.5, FFTW-3.3.7, and Intel MKL FFT, to present a novel model-based parallel computing technique as a very effective and portable method for optimization of scientific multithreaded routines for performance, especially in the current multicore era where the processors have abundant number of cores. We propose two optimization methods, PFFT-FPM and PFFT-FPM-PAD, based on this technique. They compute 2D-DFT of a complex signal matrix of size NxN using p abstract processors. Both algorit…

2018-08-16cs.DC

迈向可扩展的原位快速傅里叶变换

Towards a Scalable In Situ Fast Fourier Transform

本文旨在将快速傅里叶变换（FFT）应用于科学原位处理链以分析频谱数据，在 SENSEI 基础设施中实现了多维数据的 FFT 端点，并验证了其在多阶段原位工作流中的有效性。

2024-02-02cs.DC

AccFFT: A library for distributed-memory FFT on CPU and GPU architectures

We present a new library for parallel distributed Fast Fourier Transforms (FFT). The importance of FFT in science and engineering and the advances in high performance computing necessitate further improvements. AccFFT extends existing FFT libraries for CUDA-enabled Graphics Processing Units (GPUs) to distributed memory clusters. We use overlapping communication method to reduce the overhead of PCIe transfers from/to GPU. We present numerical results on the Maverick platform at the Texas Advanced Computing Center (TACC) and on the Titan system at the Oak Ridge National Laboratory (ORNL). We pre…

2016-05-25cs.DC

Coded Fourier Transform

University of Southern California（南加州大学）；Nokia Bell Labs（诺基亚贝尔实验室）

We consider the problem of computing the Fourier transform of high-dimensional vectors, distributedly over a cluster of machines consisting of a master node and multiple worker nodes, where the worker nodes can only store and process a fraction of the inputs. We show that by exploiting the algebraic structure of the Fourier transform operation and leveraging concepts from coding theory, one can efficiently deal with the straggler effects. In particular, we propose a computation strategy, named as coded FFT, which achieves the optimal recovery threshold, defined as the minimum number of workers…

2017-10-17cs.DCcs.ITcs.LG

更多相关论文收起更多论文

TurboFFT：GPU上协同设计的高性能容错快速傅里叶变换

TurboFFT: Co-Designed High-Performance and Fault-Tolerant Fast Fourier Transform on GPUs

针对现有GPU FFT库效率低、缺乏软错误容错能力的问题，提出协同设计高性能与在线容错的TurboFFT，通过架构感知优化和多策略ABFT实现性能优于主流库且容错开销低。

2024-12-08cs.DC

Large-Scale Discrete Fourier Transform on TPUs

In this work, we present two parallel algorithms for the large-scale discrete Fourier transform (DFT) on Tensor Processing Unit (TPU) clusters. The two parallel algorithms are associated with two formulations of DFT: one is based on the Kronecker product, to be specific, dense matrix multiplications between the input data and the Vandermonde matrix, denoted as KDFT in this work; the other is based on the famous Cooley-Tukey algorithm and phase adjustment, denoted as FFT in this work. Both KDFT and FFT formulations take full advantage of TPU's strength in matrix multiplications. The KDFT formul…

2020-12-11cs.DCcs.MS

面向平面波密度泛函理论代码的灵活多维FFT

Flexible Multi-Dimensional FFTs for Plane Wave Density Functional Theory Codes

本文提出分布式框架FFTB，为平面波密度泛函理论等应用中球体批次数据上的多维FFT提供灵活实现，支持规则/非规则网格、批处理/非批处理变换及CPU/GPU平台，并在HP Cray EX上验证了执行时间与可扩展性提升。

2024-06-08cs.DCcs.MS

TurboFFT：一种在 GPU 上具备容错能力的高性能快速傅里叶变换

TurboFFT: A High-Performance Fast Fourier Transform with Fault Tolerance on GPU

TurboFFT 通过双侧校验和方案及内核融合策略，在 GPU 上以平均 7%-15% 的低开销实现 FFT 的静默数据损坏检测与即时纠错，性能优于现有容错 FFT 方案。

2024-05-03cs.DC

A GPU Based Memory Optimized Parallel Method For FFT Implementation

FFT (fast Fourier transform) plays a very important role in many fields, such as digital signal processing, digital image processing and so on. However, in application, FFT becomes a factor of affecting the processing efficiency, especially in remote sensing, which large amounts of data need to be processed with FFT. So shortening the FFT computation time is particularly important. GPU (Graphics Processing Unit) has been used in many common areas and its acceleration effect is very obvious compared with CPU (Central Processing Unit) platform. In this paper, we present a new parallel method to …

2017-07-23cs.DC

支持向量扩展的新型RISC-V硬件上快速傅里叶变换的性能评估

Performance Evaluation of Fast Fourier Transforms on Emerging RISC-V Hardware with Vector Extension Support

Jülich Supercomputing Centre（于利希超级计算中心）

该研究评估了支持RVV 1.0的三款处理器上juFFTe库的FFT性能，发现其优于FFTW3，但RISC-V性能仍需提升以比肩AMD Zen 5架构。

2026-08-31cs.DCcs.MScs.NA

FLUPS -- a flexible and performant massively parallel Fourier transform library

Massively parallel Fourier transforms are widely used in computational sciences, and specifically in computational fluid dynamics which involves unbounded Poisson problems. In practice the latter is usually the most time-consuming operation due to its inescapable all-to-all communication pattern. The original flups library tackles that issue with an implementation of the distributed Fourier transform tailor-made for successive resolutions of unbounded Poisson problems. However the proposed implementation lacks of flexibility as it only supports cell-centered data layout and features a plain co…

2023-03-21cs.DCphysics.comp-ph

P3DFFT: a framework for parallel computations of Fourier transforms in three dimensions

Fourier and related transforms is a family of algorithms widely employed in diverse areas of computational science, notoriously difficult to scale on high-performance parallel computers with large number of processing elements (cores). This paper introduces a popular software package called P3DFFT implementing Fast Fourier Transforms (FFT) in three dimensions (3D) in a highly efficient and scalable way. It overcomes a well-known scalability bottleneck of 3D FFT implementations by using two-dimensional domain decomposition. Designed for portable performance, P3DFFT achieves excellent timings fo…

2019-05-07cs.DCcs.MS

晶圆级计算中同质网格上的滑动FFT

Slide FFT on a homogeneous mesh in wafer-scale computing

本文针对晶圆级引擎上FFT的内存开销问题，提出利用相邻PE快速互连的同步Slide操作，并在CS-2上验证了线性扩展性能，以加速多信使天文学中的信号搜索。

2024-01-04astro-ph.IMcs.DCcs.DS

A Multi-FPGA High Performance Computing System for 3D FFT-based Numerical Simulations

In the field of High Performance Computing, communications among processes represent a typical bottleneck for massively parallel scientific applications. Object of this research is the development of a network interface card with specific offloading capabilities that could help large scale simulations in terms of communication latency and scalability with the number of computing elements. In particular this work deals with the development of a double precision floating point complex arithmetic unit with a parallel-pipelined architecture, in order to implement a massively parallel computing sys…

2022-09-06cs.DCphysics.comp-ph