Two-level dynamic scheduling in PARDISO:: Improved scalability on shared memory multiprocessing systems

被引:79
作者
Schenk, O
Gärtner, K
机构
[1] Univ Basel, Dept Comp Sci, CH-4056 Basel, Switzerland
[2] Weierstr Inst Appl Anal & Stochast, D-10117 Berlin, Germany
关键词
large sparse linear systems; sparse matrix factorization; sparse LU decomposition; multiprocessor computers; parallel sparse solvers;
D O I
10.1016/S0167-8191(01)00135-1
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The PARDISO package is a mathematical library of OpenMP routines for the parallel direct solution of large sparse linear systems of equations. One objective of PARDISO is to achieve a high efficiency on shared memory multiprocessing systems. A new parallelization strategy based on a dynamic two-level scheduling scheme is therefore explored. The method aims at minimizing cache conflicts and interprocessor communication costs and, at the same time, maximizing processor load balance and Level-3 BLAS performance. The synchronization events are reduced by one order of magnitude compared with a one-level scheduling strategy. This results in an efficient parallel sparse LU decomposition method. An overview of the two-level scheduling algorithm and the key algorithmic features of the solver PARDISO is given. Finally, numerical results and a comparison with another software package demonstrate the performance. (C) 2002 Published by Elsevier Science B.V.
引用
收藏
页码:187 / 197
页数:11
相关论文
共 22 条
[1]   Multifrontal parallel distributed symmetric and unsymmetric solvers [J].
Amestoy, PR ;
Duff, IS ;
L'Excellent, JY .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 184 (2-4) :501-520
[2]   A fully asynchronous multifrontal solver using distributed dynamic scheduling [J].
Amestoy, PR ;
Duff, IS ;
L'Excellent, JY ;
Koster, J .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2001, 23 (01) :15-41
[3]  
AMESTOY PR, 2000, UNPUB ACM T MATH SOF
[4]  
BANK RE, 1983, SIAM J SCI STAT COMP, V4, P416, DOI 10.1137/0904032
[5]  
BUNCH JR, 1977, MATH COMPUT, V31, P162
[6]   An unsymmetric-pattern multifrontal method for sparse LU factorization [J].
Davis, TA ;
Duff, IS .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1997, 18 (01) :140-158
[7]   A supernodal approach to sparse partial pivoting [J].
Demmel, JW ;
Eisenstat, SC ;
Gilbert, JR ;
Li, XYS ;
Liu, JWH .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1999, 20 (03) :720-755
[8]   An asynchronous parallel supernodal algorithm for sparse Gaussian elimination [J].
Demmel, JW ;
Gilbert, JR ;
Li, XYS .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1999, 20 (04) :915-952
[9]   The design and use of algorithms for permuting large entries to the diagonal of sparse matrices [J].
Duff, IS ;
Koster, J .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1999, 20 (04) :889-901
[10]   ALGORITHM 575 - PERMUTATIONS FOR A ZERO-FREE DIAGONAL [F1] [J].
DUFF, IS .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1981, 7 (03) :387-390