Two-dimensional block partitionings for the parallel sparse Cholesky factorization

This paper presents a discussion on 2D block mappings for the sparse Cholesky factorization on parallel MIMD architectures with distributed memory. It introduces the fan-in algorithm in a general manner and proposes several mapping strategies. The grid mapping with row balancing, inspired by Rothber...

Full description

Saved in:
Bibliographic Details
Published in:Numerical algorithms Vol. 16; no. 1; pp. 17 - 38
Main Authors: Dumitrescu, B., Doreille, M., Roch, J.-L., Trystram, D.
Format: Journal Article
Language:English
Published: New York Springer Nature B.V 01.02.1997
Subjects:
Algorithms
Cholesky factorization
Distributed memory
Factorization
Fanout
Mapping
Microprocessors
ISSN:1017-1398, 1572-9265
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a discussion on 2D block mappings for the sparse Cholesky factorization on parallel MIMD architectures with distributed memory. It introduces the fan-in algorithm in a general manner and proposes several mapping strategies. The grid mapping with row balancing, inspired by Rothberg's work (1994), is proved to be more robust than the original fan-out algorithm. Even more efficient is the proportional mapping, as shown by the experiments on a 32 processor IBM SP1 and on a Cray T3D. Subforest-to-subcube mappings are also considered and give good results on the T3D.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1017-1398
1572-9265
DOI:10.1023/A:1019122726788