arXiv · 2401.05427
Slide FFT on a homogeneous mesh in wafer-scale computing
Abstract
Searches for signals at low signal-to-noise ratios frequently involve the Fast Fourier Transform (FFT). For high-throughput searches, we here consider FFT on the homogeneous mesh of Processing Elements (PEs) of a wafer-scale engine (WSE). To minimize memory overhead in the inherently non-local FFT algorithm, we introduce a new synchronous slide operation ({\em Slide}) exploiting the fast interconnect between adjacent PEs. Feasibility of compute-limited performance is demonstrated in linear scaling of Slide execution times with varying array size in preliminary benchmarks on the CS-2 WSE. The proposed implementation appears opportune to accelerate and open the full discovery potential of FFT-based signal processing in multi-messenger astronomy.
Explore related subjects
Keep this discovery
Maurice H. P. M. van Putten, Leighton Wilson, Adam W. Lavely, Mark Hair. 2024-01-04. Slide FFT on a homogeneous mesh in wafer-scale computing. https://arxiv.org/abs/2401.05427
Cite the original work for its findings. Save a collection to share your selection of sources.