Multiprocessing a sparse matrix code on the Alliant FX/8

DOI10.1016/0377-0427(89)90368-3zbMath0683.65015OpenAlexW2150603771MaRDI QIDQ1824981

Iain S. Duff

Publication date: 1989

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(89)90368-3

zbMATH Keywords

factorizationparallel implementationgranularitydata managementmultifrontal methodsminimum degree orderingMultiprocessingelimination treessparse linear equationsshared memory machinestask spawning

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (5)

On the accuracy of finite-difference solutions for nonlinear water waves ⋮ Design and Implementation of a Parallel Markowitz Threshold Algorithm ⋮ A survey of direct methods for sparse linear systems ⋮ Parallel sparse Gaussian elimination with partial pivoting ⋮ The impact of high-performance computing in the solution of linear systems: Trends and problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational models and task scheduling for parallel sparse Cholesky factorization
• Parallel implementation of multifrontal schemes
• The Multifrontal Solution of Unsymmetric Sets of Linear Equations
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• Some Design Features of a Sparse Matrix Code

This page was built for publication: Multiprocessing a sparse matrix code on the Alliant FX/8