GitHub / ShadyBoukhary / GPU-research-FFT-OpenACC-CUDA

Case studies constitute a modern interdisciplinary and valuable teaching practice which plays a critical and fundamental role in the development of new skills and the formation of new knowledge. This research studies the behavior and performance of two interdisciplinary and widely adopted scientific kernels, a Fast Fourier Transform and Matrix Multiplication. Both routines are implemented in the two current most popular many-core programming models CUDA and OpenACC. A Fast Fourier Transform (FFT) samples a signal over a period of time and divides it into its frequency components, computing the Discrete Fourier Transform (DFT) of a sequence. Unlike the traditional approach to computing a DFT, FFT algorithms reduce the complexity of the problem from O(n2) to O(nLog2n). Matrix multiplication is a cornerstone routine in Mathematics, Artificial Intelligence and Machine Learning. This research also shows that the nature of the problem plays a crucial role in determining what many-core model will provide the highest benefit in performance.

JSON API: https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShadyBoukhary%2FGPU-research-FFT-OpenACC-CUDA

Topics: acceleration, cuda, fast-fourier-transform, fft, gpu-acceleration, gpu-computing, gpu-programming, nvcc, openacc, parallel-computing, pgi, pgi-compiler, radix-2

Files

No dependencies found