Multiprocessing a sparse matrix code on the Alliant FX/8

DOI10.1016/0377-0427(89)90368-3MaRDI QIDQ1824981zbMATH OpenOpenAlexFDO

Authors 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

data managementelimination treesfactorizationgranularityminimum degree orderingmultifrontal methodsMultiprocessingparallel implementationshared memory machinessparse linear equationstask spawning

Mathematics Subject Classification ID

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

Review text

Multiprocessing of a code for the direct solution of sparse linear equations on Alliant FX/8 is presented. As solution technique the multifrontal organization is used. Introducing the basic ideas of the multifrontal methods and the elimination trees, various issues concerning parallel implementation (data management, task spawning and granularity, management of work queue and performance code) are detailed. The presented experiments are performed with a modified version on the MA37 code of the author and \textit{J. K. Reid} [SIAM J. Sci. Stat. Comput. 5, 633-641 (1984; Zbl 0557.65017)]. Only the numerical factorization of the coefficient matrix is considered and the standard minimum degree ordering is used. For a portable interface for parallel programs the use of the SCHEDULE package from Argonne on the presented scheme is discussed. Then a very useful graphic output may be obtained to a SUN workstation. The presented tailored code attains a speedup by a factor about six on the eight processors of the Alliant.

Recommendations

• scientific article; zbMATH DE number 4070168
• A parallel multifrontal algorithm and its implementation
• The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
• The design of a new frontal code for solving sparse, unsymmetric systems
• Parallel implementation of multifrontal schemes

Cites work

• Computational models and task scheduling for parallel sparse Cholesky factorization
• scientific article; zbMATH DE number 4190981 (Why is no real title available?)
• scientific article; zbMATH DE number 3976197 (Why is no real title available?)
• scientific article; zbMATH DE number 1226271 (Why is no real title available?)
• Parallel implementation of multifrontal schemes
• Some Design Features of a Sparse Matrix Code
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• The Multifrontal Solution of Unsymmetric Sets of Linear Equations

Cited in

(5)

• The impact of high-performance computing in the solution of linear systems: Trends and problems
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1824981)