It is often impossible to obtain a one-size-fits-all solution for high performance algorithms
when considering different choices for data distributions, parallelism, transformations, and …

Approximating ideal program outputs is a common technique for solving computationally
difficult problems, for adhering to processing or timing constraints, and for performance …

This article gives an overview on the techniques needed to implement the discrete Fourier
transform (DFT) efficiently on current multicore systems. The focus is on Intel-compatible …

Breadth-first Search (BFS) is a fundamental graph theory algorithm that is extensively used
to abstract various challenging computational problems. Due to the fine-grained irregular …

High performance extended math library is used by many scientific engineering and artificial
intelligence applications, which usually involves many common mathematical computations …

Fast Fourier transform (FFT) is widely used in computing applications in large-scale parallel
programs, and data communication is the main performance bottleneck of FFT and seriously …

The demand for thread-level-parallelism (TLP) on commodity processors is endless as it is
essential for gaining performance and saving energy. However, TLP in today's programs is …

The Uintah Software framework was developed to provide an environment for solving fluid-
structure interaction problems on structured adaptive grids on large-scale, long-running …

Stencil computations comprise an important class of kernels in many scientific computing
applications. As the diversity of both architectures and programming models grow …

Future many-core processor systems require scalable solutions that conventional
architectures currently do not provide. This paper presents a novel architecture that …