The SPIKE algorithm [1, 2] is an efficient generic divide-and-conquer algorithm for solving banded systems. With partitioning the matrices into several blocks, sufficient concurrency can be exploited on GPUs. We implemented SPIKE::GPU, a solver which exploits the truncated SPIKE as pre-conditioner and then the pre-conditioned result is refined with BiCGStab. Our current results show that SPIKE::GPU can perform more than two times as fast as the banded linear system solver in Intel’s Math Kernel Library (MKL) and up to three times if the kernel is manually tuned
We study the performance of three parallel algorithms and their hybrid variants for solving tridiago...
We present implementation details of a reordering strategy for permuting elements whose absolute val...
Achieving high performance and performance portability for large-scale scientific applications is a ...
SPIKE::GPU is a solver developed in the Simulation Based Engineering Lab (SBEL) [1] to solve large b...
This contribution outlines an approach that draws on general purpose graphics processing unit (GPGPU...
A new parallel solver based on SPIKE-TA algorithm has been developed using OpenMP API for solving d...
With availability of large-scale parallel platforms comprised of tens-of-thousands of processors and...
The explicit Spike algorithm applies to narrow banded linear systems which are strictly diagonally d...
ii This paper describes the SPIKE algorithm for solving large banded linear systems using a divide-a...
Tridiagonal diagonally dominant linear systems arise in many scientific and engineering applications...
The truncated SPIKE algorithm is a parallel solver for linear systems which are banded and strictly ...
Solving diagonally dominant tridiagonal linear systems is a common problem in scientific high-perfor...
The original publication is available at www.springerlink.comInternational audienceA wide class of g...
Extended version of EuroGPU symposium article, in the International Conference on Parallel Computing...
to appearInternational audienceA wide class of numerical methods needs to solve a linear system, whe...
We study the performance of three parallel algorithms and their hybrid variants for solving tridiago...
We present implementation details of a reordering strategy for permuting elements whose absolute val...
Achieving high performance and performance portability for large-scale scientific applications is a ...
SPIKE::GPU is a solver developed in the Simulation Based Engineering Lab (SBEL) [1] to solve large b...
This contribution outlines an approach that draws on general purpose graphics processing unit (GPGPU...
A new parallel solver based on SPIKE-TA algorithm has been developed using OpenMP API for solving d...
With availability of large-scale parallel platforms comprised of tens-of-thousands of processors and...
The explicit Spike algorithm applies to narrow banded linear systems which are strictly diagonally d...
ii This paper describes the SPIKE algorithm for solving large banded linear systems using a divide-a...
Tridiagonal diagonally dominant linear systems arise in many scientific and engineering applications...
The truncated SPIKE algorithm is a parallel solver for linear systems which are banded and strictly ...
Solving diagonally dominant tridiagonal linear systems is a common problem in scientific high-perfor...
The original publication is available at www.springerlink.comInternational audienceA wide class of g...
Extended version of EuroGPU symposium article, in the International Conference on Parallel Computing...
to appearInternational audienceA wide class of numerical methods needs to solve a linear system, whe...
We study the performance of three parallel algorithms and their hybrid variants for solving tridiago...
We present implementation details of a reordering strategy for permuting elements whose absolute val...
Achieving high performance and performance portability for large-scale scientific applications is a ...