Two-dimensional block partitionings for the parallel sparse Cholesky factorization

DOI10.1023/A:1019122726788MaRDI QIDQ1385158zbMATH OpenOpenAlexFDO

Authors M. Doreille, B. Dumitrescu, Jean-Louis Roch, Denis Trystram

Publication date 17 August 1999

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1019122726788

zbMATH Keywords

block partitioningdistributed-memory computer systemsmapping algorithmsparallel computationsparse Cholesky factorization

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Review text

The planar mappings of matrix data in sparse Cholesky factorization for distributed-memory computer systems of the MIMD-type are discussed. Several mapping strategies are analyzed and tested, e.g. fan-in, fan-out, grid mapping with row balancing, proportional and subforest-to-subcube mapping. New heuristics enable to improve existing block column mapping algorithms. The algorithms developed are tested and compared on IBM SP1 and Crat T3D systems.

Recommendations

• scientific article; zbMATH DE number 833696
• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization

Cited in

(7)

• The impact of high-performance computing in the solution of linear systems: Trends and problems
• Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
• Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
• scientific article; zbMATH DE number 554769 (Why is no real title available?)
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• scientific article; zbMATH DE number 720649 (Why is no real title available?)
• scientific article; zbMATH DE number 833696 (Why is no real title available?)

Describes a project that uses

Uses Software

• BLAS

This page was built for publication: Two-dimensional block partitionings for the parallel sparse Cholesky factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1385158)