Scheduling FFT computation on SMP and multicore systems

Abstract

Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code within a palatable amount of time. With the emergence of multicore (CMP), multiprocessor (SMP) and hybrid shared memory multiprocessor architectures, achieving high efficiency is becoming even more challenging. To address the challenge to achieve high efficiency in performance critical applications, domain specific frameworks have been developed that aid the compilers in scheduling the computations. We have developed a portable framework for the Fast Fourier Transform (FFT) that achieves high efficiency by automatically adapting to various architectural features. Adapting to parallel architectures by searching through all the combinations of schedules (plans) is an expensive task, even when the search is conducted in parallel. In this paper, we develop heuristics to simplify the generation of better schedules for parallel FFT computations on CMP/SMP systems. We evaluate the performance of OpenMP and PThreads implementations of FFT on a number of latest architectures. The performance of parallel FFT schedules is compared with that of the best plan generated for sequential FFT and the speedup for different number of processors is reported. In the end, we also present a performance comparison between the UHFFT and FFTW implementations.

Fast and Optimal Binary Template Matching Application to Manga Copyright Protection

“…(8). This is straightforward to compute as a single multiplication is needed following the δ m (u, v) summing.…”

“…The FFT becomes more efficient when M, N m, n are large. The computation of the FFT can be supported by parallel implementation that can achieve acceleration factors of 3 to 7 using GPU [8], but raising other constraints linked to application portability.…”

“…The major reasons are the no-invariance to scale and rotation, the lack of adaptability of similarity measures and the time-complexity. However, different contributions have been investigated during the last years to improve these aspects including the robustness and discrimination capability of similarity measures [4], [5], their characterization [5], [6], the timeprocessing optimization with hardware support [7], [8], etc.…”

Language and compiler support for auto-tuning variable-accuracy algorithms

“…A system by Kessler et al [19], [20] automatically composes algorithms using emperical techniques. Other autotuning systems include SPARSITY [21] for sparse matrix computations, SPIRAL [22], [23], [24] for digital signal processing, UHFFT [25] for FFT on multicore systems, and OSKI [26] for sparse matrix kernels. ActiveHarmony [27], [28] provides a general framework for tuning configurable libraries and exploring different compiler optimizations.…”

A Framework for Multiple Object Tracking in Underwater Acoustic MIMO Communication Channels

“…In 2007, Ali, A. et al developed a portable framework for FFT algorithms to run on various parallel architectures. The computational framework was also formulated using the language of Kronecker products [14]. In 2008, Rodríguez, D. co-authored an article where a methodology was presented for the high-level partitioning of signal transforms onto distributed hardware architectures using, again, the language of Kronecker products signal algebra [15].…”