1-Dimensional parallel FFT benchmark on SUPRENUM

. A distributed memory vectorised 1-dimensional FFT benchmark is first presented. The performance results of this benchmark on SUPRENUM are given and discussed. A performance analysis of the distributed memory FFT benchmark is performed and Hockney's performance parameters (r1 and n 1=2 ) are then employed to derive the performance formula. This formula is shown to fit the experimental results very well. A generalization of the analysis for uniformly distributed applications is also discussed, as well as some important characteristics such as the calculation/communication ratio, the fit of the application to the architecture, the average message length and the average vector length. Keywords: distributed memory FFT benchmark; performance formulae and parameters; SUPRENUM performance. 1 Introduction FFT algorithms are largely used to transform physical processes from the time domain to the frequency domain (Fourier analysis) or from the frequency domain to the time domain (Fourier syn..

Protein-Kinase A and Human Disease: The Core of cAMP-Dependent Signaling in Health and Disease

info:eu-repo/semantics/publishe