Understanding the efficiency of parallel incomplete Cholesky preconditioners on the performance of ICCG solvers for multi-core and GPU systems

Author

Moghnieh, Hussein ; Lowther, David A.

Author_Institution

Dept. of Electr. & Comput. Eng., McGill Univ., Montreal, QC, Canada

fYear

2010

fDate

9-12 May 2010

Firstpage

1

Lastpage

1

Abstract

This paper aims at understanding the effect of parallelizing incomplete Cholesky (IC) factorization on the overall performance of the incomplete Cholesky conjugate gradient (ICCG) solver method, optimized on multi-core and GPU based Systems. Parallel IC preconditioners, which are based on graph reordering and arbitrary levels of allowed fill-in, are tested on structured and unstructured matrices to study the tradeoffs between the level of fill-in, degree of IC parallelism and convergence rate of the ICCG solver.

Keywords

conjugate gradient methods; matrix decomposition; multiprocessing systems; GPU system; ICCG solver; incomplete Cholesky conjugate gradient; incomplete Cholesky factorization; multicore system; parallel incomplete Cholesky preconditioner; Character generation; Convergence; Finite element methods; Linear systems; Matrix decomposition; Multicore processing; Optimization methods; Parallel processing; Sparse matrices; Symmetric matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Electromagnetic Field Computation (CEFC), 2010 14th Biennial IEEE Conference on

Conference_Location

Chicago, IL

Print_ISBN

978-1-4244-7059-4

Type

conf

DOI

10.1109/CEFC.2010.5481252

Filename

5481252