Two-dimensional block partitionings for the parallel sparse Cholesky factorization (Q1385158)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1146036
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-dimensional block partitionings for the parallel sparse Cholesky factorization |
scientific article; zbMATH DE number 1146036 |
Statements
Two-dimensional block partitionings for the parallel sparse Cholesky factorization (English)
0 references
17 August 1999
0 references
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.
0 references
block partitioning
0 references
parallel computation
0 references
sparse Cholesky factorization
0 references
distributed-memory computer systems
0 references
mapping algorithms
0 references
0.8522463440895081
0 references
0.8501749038696289
0 references
