Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver

DOI10.1137/S0895479802419877zbMath1075.65039MaRDI QIDQ4651010

Christof Vömel, Iain S. Duff, Patrick R. Amestoy

Publication date: 21 February 2005

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

numerical examplessparse linear systemshigh performance computingtask schedulingMUMPSmultifrontal Gaussian eliminationdistributed memory code

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices ⋮ A two-dimensional domain decomposition technique for the simulation of quantum-scale devices ⋮ A fast direct solver for elliptic problems on general meshes in 2D ⋮ The Secret Life of Keys: On the Calculation of Mechanical Lock Systems ⋮ A survey of direct methods for sparse linear systems