The Fast Fourier Transform (FFT) is of great importance for various scientific applications used in High Performance Computing (HPC). However, a detailed performance analysis shows that the FFT routines used in these applications, prevent them from scaling to large processor counts. The All-to-All type communication required inside these transformation routines, which becomes extremely costly w...

A novel FFT-based phase-field fracture framework for modelling fatigue crack initiation and propagation at the microscale is presented. damage driving force defined based on stored energy dislocation density, relating with microstructural damage. The formulation numerically implemented using FFT methods to enable of sufficiently large, representative 3D regions. early stages cracking are simula...

Functional Family Therapy (FFT) is an intensive community-based treatment program designed to reduce youth behavior problems such as violence, drug use, and other delinquency. Although there is evidence of FFT efficacy and effectiveness with predominantly White samples, there is very little evidence with racial/ethnic minority samples. In light of the over-representation of African American and...

We present the automatic synthesis of the HPC Challenge’s Global FFT, a large 1D FFT across a whole supercomputer system. We extend the Spiral system to synthesize specialized single-node FFT libraries that combine a data layout transformation with the actual on-node FFT computation to improve the network performance through enabling all-to-all collectives. We run our optimized Global FFT bench...

In this paper, we present a new fast Fourier transform (FFT) algorithm to reduce the table size of twiddle factors required in pipelined FFT processing. The table size is large enough to occupy significant area and power consumption in long-point FFT processing. The proposed algorithm can reduce the table size to half, compared to the radix-22 algorithm, while retaining the simple structure. To...