Reducing the number of data accesses in memory hierarchy is of paramount importance on
modern computer systems. One of the key optimizations addressing this problem is loop …

This paper describes FFTS, a discrete Fourier transform (DFT) library that achieves state-of-
the-art performance using a new cache-oblivious algorithm implemented with run-time …

This paper presents an efficient architecture for performing 128 points to 1M points Fast
Fourier Transformation (FFT) based on mixed radix-2/4/8 butterfly unit. The proposed FFT …

The fast Fourier transform (FFT) is perhaps today's most ubiquitous algorithm used with
digital data; hence, it is still being studied extensively. Besides the benefit of reducing the …

This thesis describes how to compute the fast Fourier transform (FFT) of a power-of-two
length signal on single-instruction, multiple-data (SIMD) microprocessors faster than or very …

In this paper, a new methodology for speeding up edge and line detection algorithms is
presented, achieving improved performance over the state of the art software library …

Loop tiling is a well-known loop transformation that enhances data locality in memory
hierarchy. In this paper, we initially reveal two important inefficiencies of current analytical …

Abstract The Matrix Vector Multiplication algorithm is an important kernel in most varied
domains and application areas and the performance of its implementations highly depends …

It is well-known that today׳ s compilers and state of the art libraries have three major
drawbacks. First, the compiler sub-problems are optimized separately; this is not efficient …

Les architectures multi-cœurs Intel Core (IvyBridge, Haswell,...) contiennent à la fois des
cœurs CPU généralistes (4), mais aussi des cœurs dédiés GPU embarqués sur cette même …