The Community for Technology Leaders
2010 13th IEEE International Conference on Computational Science and Engineering (2010)
Hong Kong, China
Dec. 11, 2010 to Dec. 13, 2010
ISBN: 978-0-7695-4323-9
pp: 253-260
ABSTRACT
Recent developments in high performance computer architecture have a significant effect on all fields of scientific computing. Linear algebra and especially the solution of linear systems of equations lies at the heart of many applications in scientific computing. This paper describes and analyzes three parallel versions of the dense LU factorization method that is used in linear system solving on a multicore using OpenMP interface. More specifically, we present two naive parallel algorithms based on row block and row cyclic data distribution and we put special emphasis on presenting a third parallel algorithm based on the pipeline technique. Further, we propose an implementation of the pipelining technique in OpenMP. Experimental results on a multicore CPU show that the proposed OpenMP pipeline implementation achieves good overall performance compared to the other two naive parallel methods. Finally, in this work we propose a simple, fast and reasonably analytical model to predict the performance of the LU decomposition method with the pipelining technique.
INDEX TERMS
Linear algebra, factorization, LU, multicore, OpenMP, parallel algorithms
CITATION

K. G. Margaritis and P. D. Michailidis, "Implementing Parallel LU Factorization with Pipelining on a MultiCore Using OpenMP," 2010 13th IEEE International Conference on Computational Science and Engineering(CSE), Hong Kong, China, 2010, pp. 253-260.
doi:10.1109/CSE.2010.39
434 ms
(Ver 3.3 (11022016))