Parallelization of Multilevel Preconditioners Constructed from Inverse-Based ILUs on Shared-Memory Multiprocessors

被引：0

作者：

Aliaga, Jose I. ^{[1
]}

Bollhoefer, Matthias ^{[2
]}

Martin, Alberto F. ^{[1
]}

Quintana-Orti, Enrique S. ^{[1
]}

机构：

[1] Univ Jaume 1, Dept Ingn & Ciencia Comp, Castellon de La Plana 12071, Spain

[2] TU Braunschweig, Inst Computat Math, D-38106 Braunschweig, Germany

来源：

PARALLEL COMPUTING: ARCHITECTURES, ALGORITHMS AND APPLICATIONS | 2008年 / 15卷

关键词：

D O I：

暂无

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this paper. we present an OpenMP parallel preconditioner based on ILUPACK. We employ the METIS library to locate independent tasks which ire dynamically scheduled to a pool of threads to attain a better load balance. Experimental results on a shared-memory platform consisting of 16 processors report the performance of our parallel algorithm.

引用

页码：287 / +

页数：2

共 12 条

[1]

[Anonymous], OPENMP SPEC

[2]

[Anonymous], 2003, ITERATIVE METHODS SP, DOI DOI 10.1137/1.9780898718003

[3] A robust and efficient ILU that incorporates the growth of the inverse triangular factors [J].

Bollhöfer, M .

SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2003, 25 (01) :86-103

[4] On the relations between ILUs and factored approximate inverses [J].

Bollhöfer, M ;

Saad, Y .

SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2002, 24 (01) :219-237

[5] A robust ILU with pivoting based on monitoring the growth of the inverse factors [J].

Bollhöfer, M .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2001, 338 (1-3) :201-218

[6]

Chan E, 2007, SPAA'07: PROCEEDINGS OF THE NINETEENTH ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, P116

[7]

Davis T. A., 2006, DIRECT METHODS SPARS

[8]

Davis Tim., U FLORIDA SPARSE MAT

[9] A fast and high quality multilevel scheme for partitioning irregular graphs [J].

Karypis, G ;

Kumar, V .

SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) :359-392

[10] A comparison of task pools for dynamic load balancing of irregular algorithms [J].

Korch, M ;

Rauber, T .

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2004, 16 (01) :1-47

← 1 2 →