Supernodal Sparse Cholesky Factorization on Distributed-Memory Multiprocessors

The concept of supernodes has been widely used in the design of algorithms for the solution of sparse linear systems of equations. This paper discusses the use of supernodes in the design of algorithms for sparse Cholesky factorization on distributed-memory multiprocessors. A new algorithm that is c...

Full description

Saved in:
Bibliographic Details
Published in:1993 International Conference on Parallel Processing - ICPP'93 Vol. 3; pp. 18 - 22
Main Authors: Eswar, Kalluri, Sadayappan, P., Huang, Chua-Huang, Visvanathan, V.
Format: Conference Proceeding
Language:English
Published: IEEE 01.08.1993
Subjects:
Algorithm design and analysis
Equations
Information science
Linear systems
Parallel processing
Performance analysis
Sparse matrices
Supercomputers
Taxonomy
Workstations
ISBN:0849389836, 9780849389832
ISSN:0190-3918
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The concept of supernodes has been widely used in the design of algorithms for the solution of sparse linear systems of equations. This paper discusses the use of supernodes in the design of algorithms for sparse Cholesky factorization on distributed-memory multiprocessors. A new algorithm that is communication efficient, has good load balance, and benefits significantly from supernodes is presented.
ISBN:0849389836
9780849389832
ISSN:0190-3918
DOI:10.1109/ICPP.1993.170