DaggerFFT: A Distributed FFT Framework Using Task Scheduling in Julia
Sana Taghipour Anvari, Julian Samaroo, Matin Raayai Ardakani, David Kaeli

TL;DR
DaggerFFT is a Julia-based distributed FFT framework that uses dynamic task scheduling to improve scalability and performance on heterogeneous HPC systems, outperforming existing libraries.
Contribution
Introduces DaggerFFT, a novel distributed FFT framework leveraging dynamic task scheduling in Julia, enhancing scalability and performance on CPU and GPU clusters.
Findings
Achieves up to 2.6x speedup on CPU clusters
Achieves up to 1.35x speedup on GPU clusters
Demonstrates improved performance and modularity in real-world simulations
Abstract
The Fast Fourier Transform (FFT) is a fundamental numerical technique with widespread application in a range of scientific problems. As scientific simulations attempt to exploit exascale systems, there has been a growing demand for distributed FFT algorithms that can effectively utilize modern heterogeneous high-performance computing (HPC) systems. Conventional FFT algorithms commonly encounter performance bottlenecks, especially when run on heterogeneous platforms. Most distributed FFT approaches rely on static task distribution and require synchronization barriers, limiting scalability and impacting overall resource utilization. In this paper we present DaggerFFT, a distributed FFT framework, developed in Julia, that treats highly parallel FFT computations as a dynamically scheduled task graph. Each FFT stage operates on a separately defined distributed array. FFT operations are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Computer Graphics and Visualization Techniques · Advanced Data Storage Technologies
