Abstract
Linear algebra algorithms commonly encapsulate parallelism in Basic Linear Algebra Subroutines (BLAS). This solution relies on the fork-join model of parallel execution, which may result in suboptimal performance on current and future generations of multi-core processors. To overcome the shortcomings of this approach a pipelined model of parallel execution is presented, and the idea of look ahead is utilized in order to suppress the negative effects of sequential formulation of the algorithms. Application to one-sided matrix factorizations, LU, Cholesky and QR, is described. Shared memory implementation using POSIX threads is presented. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Kurzak, J., & Dongarra, J. (2007). Implementing linear algebra routines on multi-core processors with pipelining and a look ahead. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4699 LNCS, pp. 147–156). Springer Verlag. https://doi.org/10.1007/978-3-540-75755-9_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
