Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/2469
Nаziv: | A performance analysis of computing the LU and the QR matrix decompositions on the CPU and the GPU | Аutоri: | Gajić, Dušan Stanković R. Radmanović M. |
Dаtum izdаvаnjа: | 1-јан-2017 | Čаsоpis: | International Journal of Reasoning-based Intelligent Systems | Sažetak: | 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 |
Nаlаzi sе u kоlеkciјаmа: | FTN Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
2
prоvеrеnо 03.05.2024.
Prеglеd/i stаnicа
22
Prоtеklа nеdеljа
9
9
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.