Computational models and task scheduling for parallel sparse Cholesky factorization
type: Item
instance of: scholarly article
title: Computational models and task scheduling for parallel sparse Cholesky factorization
zbMATH Open document ID: 0609.65014
DOI: 10.1016/0167-8191(86)90014-1
author: Joseph W. H. Liu
published in: Parallel Computing
publication date: 1986-01-01T00:00:00Z
review text: The numerical solution of linear systems has the following typical phases: ordering, symbolic factorization, numeric factorization, and numeric substitution. In this paper the numeric factorization phase for parallel computation is studied. A parallel sparse Cholesky factorization algorithm is formulated. It is suitable for parallel machines with shared-memory architecture, like Denelcor HEP. The algorithm is based on the medium-grained graph model of column-oriented tasks and a critical path type of scheduling. A variant of the scheme allowing preemption is also described. The algorithm assumes that the given matrix has already been ordered by some fill-reducing ordering algorithm, e.g. the minimum degree ordering.
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65F50
zbMATH DE Number: 3986520
zbMATH Keywords: numeric factorization
zbMATH Keywords: parallel sparse Cholesky factorization
zbMATH Keywords: medium- grained graph model
zbMATH Keywords: scheduling
zbMATH Keywords: fill-reducing ordering
zbMATH Keywords: minimum degree ordering
MaRDI profile type: Publication
full work available at URL: 0167-8191(86)90014-1
OpenAlex ID: W1980946208
description: scientific article; zbMATH DE number 3986520