Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/2469
Title: | A performance analysis of computing the LU and the QR matrix decompositions on the CPU and the GPU | Authors: | Gajić, Dušan Stanković R. Radmanović M. |
Issue Date: | 1-Jan-2017 | Journal: | International Journal of Reasoning-based Intelligent Systems | Abstract: | Copyright © 2017 Inderscience Enterprises Ltd. We present an analysis of time efficiency of five different implementations of the LU and the QR decomposition of matrices performed on central processing unit (CPUs) and graphics processing units (GPUs). Three of the considered implementations, developed using the Eigen C++ library, Intel MKL, and MATLAB are executed on a multi-core CPU. The remaining two implementations are processed on a GPU and employ MATLAB's Parallel Computing Toolbox and Nvidia CUDA augmented with the cuSolver library. Computation times are compared using randomly generated single- and double-precision floating-point matrices. The experiments for the LU decomposition show that the two GPU implementations offer best performance for matrices that can fit into the GPU global memory. For larger LU decomposition problem instances, Intel MKL on the CPU is found to be the fastest approach. Furthermore, Intel MKL also proves to be the fastest method for computing QR decomposition for all considered sizes of matrices. | URI: | https://open.uns.ac.rs/handle/123456789/2469 | ISSN: | 17550556 | DOI: | 10.1504/IJRIS.2017.088701 |
Appears in Collections: | FTN Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
2
checked on May 3, 2024
Page view(s)
22
Last Week
9
9
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.