Multiprocessing a sparse matrix code on the Alliant FX/8
type: Item
instance of: scholarly article
title: Multiprocessing a sparse matrix code on the Alliant FX/8
zbMATH Open document ID: 0683.65015
DOI: 10.1016/0377-0427(89)90368-3
published in: Journal of Computational and Applied Mathematics
publication date: 1989-01-01T00:00:00Z
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.
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 4119483
zbMATH Keywords: shared memory machines
zbMATH Keywords: Multiprocessing
zbMATH Keywords: sparse linear equations
zbMATH Keywords: multifrontal methods
zbMATH Keywords: elimination trees
zbMATH Keywords: parallel implementation
zbMATH Keywords: data management
zbMATH Keywords: task spawning
zbMATH Keywords: granularity
zbMATH Keywords: factorization
zbMATH Keywords: minimum degree ordering
author: Iain S. Duff
MaRDI profile type: Publication
full work available at URL: 0377-0427(89)90368-3
OpenAlex ID: W2150603771
cites work: Q4220434
cites work: Parallel implementation of multifrontal schemes
cites work: Some Design Features of a Sparse Matrix Code
cites work: Q3740904
cites work: Q3210039
cites work: The Multifrontal Solution of Indefinite Sparse Symmetric Linear
cites work: The Multifrontal Solution of Unsymmetric Sets of Linear Equations
cites work: Computational models and task scheduling for parallel sparse Cholesky factorization
description: scientific article; zbMATH DE number 4119483