Have a personal or library account? Click to login
The Parallel Tiled WZ Factorization Algorithm for Multicore Architectures Cover

The Parallel Tiled WZ Factorization Algorithm for Multicore Architectures

Open Access
|Jul 2019

Abstract

The aim of this paper is to investigate dense linear algebra algorithms on shared memory multicore architectures. The design and implementation of a parallel tiled WZ factorization algorithm which can fully exploit such architectures are presented. Three parallel implementations of the algorithm are studied. The first one relies only on exploiting multithreaded BLAS (basic linear algebra subprograms) operations. The second implementation, except for BLAS operations, employs the OpenMP standard to use the loop-level parallelism. The third implementation, except for BLAS operations, employs the OpenMP task directive with the depend clause. We report the computational performance and the speedup of the parallel tiled WZ factorization algorithm on shared memory multicore architectures for dense square diagonally dominant matrices. Then we compare our parallel implementations with the respective LU factorization from a vendor implemented LAPACK library. We also analyze the numerical accuracy. Two of our implementations can be achieved with near maximal theoretical speedup implied by Amdahl’s law.

DOI: https://doi.org/10.2478/amcs-2019-0030 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 407 - 419
Submitted on: Sep 8, 2018
|
Accepted on: Mar 2, 2019
|
Published on: Jul 4, 2019
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2019 Beata Bylina, Jarosław Bylina, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.