2024-03-29T15:19:34Zhttps://repositori.uji.es/oai/requestoai:repositori.uji.es:10234/1635302023-07-21T09:33:12Zcom_10234_7036com_10234_9col_10234_61544
00925njm 22002777a 4500
dc
Benner, Peter
author
Ezzatti, Pablo
author
Quintana-Orti, Enrique S.
author
Remón, Alfredo
author
2016-04-02
In 1979, P. Huard presented an efficient variant of the Gauss-Jordan elimination for the solution of linear systems. In particular, this alternative algorithm exhibits the same computational cost as the traditional LU-based solver, and is considerably cheaper than the Gauss-Jordan algorithm, but there exist no recent high performance implementations of the Gauss-Huard (GH) variant that allow a comparison of these approaches. In this paper we present a reliable GH solver for hybrid platforms equipped with conventional multi-core technology and a graphics processing unit (GPU). The experimental results show that the GH algorithm can beat high performance versions of the LU solver, from tuned libraries for CPU-GPU servers such as MAGMA, for problems of small to moderate scale.
BENNER, Peter, et al. Revisiting the Gauss-Huard Algorithm for the Solution of Linear Systems on Graphics Accelerators. En International Conference on Parallel Processing and Applied Mathematics. Springer International Publishing, 2015. p. 505-514.
978-3-319-32148-6
http://hdl.handle.net/10234/163530
http:\\dx.doi.org/10.1007/978-3-319-32149-3_47
Dense linear systems
Gauss-Huard algorithm
LU factorization
Multi-core processors
Graphics Processing Units (GPUs)
High performance
Revisiting the Gauss-Huard Algorithm for the Solution of Linear Systems on Graphics Accelerators