Reordering for parallelism

The proposed ordering scheme is the fusion of Jess and Kees method and the Minimum degree ordering, that operates on a non-chordal graph. The method produces a fill preserving ordering for all the test problems selected from the Boeing-Harwell Sparse matrix collection. The extent of parallelism extr...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of computer mathematics Vol. 67; no. 3-4; pp. 373 - 390
Main Authors:	Padmini, M.V., Madan, B.B., Jain, B.N.
Format:	Journal Article
Language:	English
Published:	Abingdon Gordon and Breach Science Publishers 01-01-1998 Taylor and Francis
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences cholesky factorisation Computer science; control theory; systems Exact sciences and technology F2.1 full-in G1.3 Mathematics Numerical analysis Numerical analysis. Scientific computation Numerical linear algebra parallel ordering Sciences and techniques of general use Sparse matrix Theoretical computing Tree(graph) Order degree Cholesky method Factorization method Sparse matrix Parallel computation Graph theory
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	The proposed ordering scheme is the fusion of Jess and Kees method and the Minimum degree ordering, that operates on a non-chordal graph. The method produces a fill preserving ordering for all the test problems selected from the Boeing-Harwell Sparse matrix collection. The extent of parallelism extracted is nearly the same as that obtained by using Liu's tree rotation heuristic.
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0020-7160 1029-0265
DOI:	10.1080/00207169808804670