Neville elimination on multi- and many-core systems: OpenMP, MPI and CUDA

Authors:
P. Alonso;R. Cortina;F. J. Martínez-Zaldívar;J. Ranilla
Affiliations:
Departamento de Matemáticas, Universidad de Oviedo, Oviedo, Spain;Departamento de Informática, Universidad de Oviedo, Oviedo, Spain;Departamento de Comunicaciones, Universidad Politécnica de Valencia, Valencia, Spain;Departamento de Informática, Universidad de Oviedo, Oviedo, Spain
Venue:
The Journal of Supercomputing
Year:
2011

Citing 3
Cited 3

Parallel programming in OpenMP

Parallel programming in OpenMP
The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System

SIAM Journal on Matrix Analysis and Applications
Scalability of Neville elimination using checkerboard partitioning

International Journal of Computer Mathematics - Recent Advances in Computational and Applied Mathematics in Science and Engineering

Accelerating incompressible flow computations with a Pthreads-CUDA implementation on small-footprint multi-GPU platforms

The Journal of Supercomputing
Virtualization of reconfigurable coprocessors in HPRC systems with multicore architecture

Journal of Systems Architecture: the EUROMICRO Journal
Performance evaluation of OpenMP and CUDA on multicore systems

ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes several parallel algorithmic variations of the Neville elimination. This elimination solves a system of linear equations making zeros in a matrix column by adding to each row an adequate multiple of the preceding one. The parallel algorithms are run and compared on different multi- and many-core platforms using parallel programming techniques as MPI, OpenMP and CUDA.