We describe an implementation of a multi-threaded NFFT (nonequispaced fast Fourier transform) software library and present the used parallelization approaches. Besides the NFFT kernel, the NFFT on the two-sphere and the fast summation based on NFFT are also parallelized. Thereby, the parallelization is based on OpenMP and the multi-threaded FFTW library. Furthermore, benchmarks for various cases are performed. The results show that an efficiency higher than 0.50 and up to 0.79 can still be achieved at 12 threads
Increased complexity of memory systems to ameliorate the gap between the speed of processors and mem...
Fourier methods have revolutionized many fields of science and engineering, such as astronomy, medic...
An efficient parallel form in digital signal processor can improve the algorithm performance. The bu...
We describe an implementation of a multi-threaded NFFT (nonequispaced fast Fourier transform) softwa...
We describe an implementation of a multi-threaded NFFT (nonequispaced fast Fourier transform) softwa...
We present a MPI based software library for computing the fast Fourier transforms on massively paral...
We present a MPI based software library for computing the fast Fourier transforms on massively paral...
We present a MPI based software library for computing the fast Fourier transforms on massively paral...
We present a MPI based software library for computing the fast Fourier transforms on massively paral...
We present a MPI based software library for computing the fast Fourier transforms on massively paral...
Abstract. We present an MPI based software library for computing fast Fourier transforms (FFTs) on m...
Abstract. In this paper we describe a parallel algorithm for calculating nonequispaced fast Fourier ...
AbstractThe development of the fast Fourier transform (FFT) and its numerous variants in the past 30...
In this paper we describe a parallel algorithm for calculating nonequispaced fast Fourier transforms...
In this paper we describe a parallel algorithm for calculating nonequispaced fast Fourier transforms...
Increased complexity of memory systems to ameliorate the gap between the speed of processors and mem...
Fourier methods have revolutionized many fields of science and engineering, such as astronomy, medic...
An efficient parallel form in digital signal processor can improve the algorithm performance. The bu...
We describe an implementation of a multi-threaded NFFT (nonequispaced fast Fourier transform) softwa...
We describe an implementation of a multi-threaded NFFT (nonequispaced fast Fourier transform) softwa...
We present a MPI based software library for computing the fast Fourier transforms on massively paral...
We present a MPI based software library for computing the fast Fourier transforms on massively paral...
We present a MPI based software library for computing the fast Fourier transforms on massively paral...
We present a MPI based software library for computing the fast Fourier transforms on massively paral...
We present a MPI based software library for computing the fast Fourier transforms on massively paral...
Abstract. We present an MPI based software library for computing fast Fourier transforms (FFTs) on m...
Abstract. In this paper we describe a parallel algorithm for calculating nonequispaced fast Fourier ...
AbstractThe development of the fast Fourier transform (FFT) and its numerous variants in the past 30...
In this paper we describe a parallel algorithm for calculating nonequispaced fast Fourier transforms...
In this paper we describe a parallel algorithm for calculating nonequispaced fast Fourier transforms...
Increased complexity of memory systems to ameliorate the gap between the speed of processors and mem...
Fourier methods have revolutionized many fields of science and engineering, such as astronomy, medic...
An efficient parallel form in digital signal processor can improve the algorithm performance. The bu...