Task scheduling for parallel sparse Cholesky factorization (Q915427)
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 4151802
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Task scheduling for parallel sparse Cholesky factorization |
scientific article; zbMATH DE number 4151802 |
Statements
Task scheduling for parallel sparse Cholesky factorization (English)
0 references
1989
0 references
subtree to subcube mapping
0 references
task scheduling
0 references
sparse Cholesky factorization
0 references
parallel computing
0 references
multiprocessor system
0 references
elimination trees
0 references
finite-element problems
0 references
0.9665187
0 references
0.9334858
0 references
0.9313809
0 references
0.9257248
0 references
0.91125643
0 references
