Communication results for parallel sparse Cholesky factorization on a hypercube
type: Item
instance of: scholarly article
title: Communication results for parallel sparse Cholesky factorization on a hypercube
zbMATH Open document ID: 0687.65024
DOI: 10.1016/0167-8191(89)90101-4
author: K. Appert
published in: Parallel Computing
publication date: 1989-01-01T00:00:00Z
review text: In recent years, parallel algorithms have been developed for solving sparse positive definite systems. In this paper, the authors have considered the problem of reducing data traffic between processor nodes during the execution of a parallel algorithm. A task assignment strategy based on the structure of an elimination tree is considered. The paper also contains some numerical experiments, which show that the new allocation scheme does reduce communication traffic and leads to improvements in the performance.
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 4126568
zbMATH Keywords: Cholesky factorization
zbMATH Keywords: parallel algorithms
zbMATH Keywords: sparse positive definite systems
zbMATH Keywords: task assignment strategy
zbMATH Keywords: elimination tree
zbMATH Keywords: numerical experiments
zbMATH Keywords: allocation scheme
reviewed by: Muhammad Aslam Noor
MaRDI profile type: Publication
full work available at URL: 0167-8191(89)90101-4
OpenAlex ID: W1968235986
description: scientific article; zbMATH DE number 4126568