Scheduling Sparse Symmetric Fan-Both Cholesky Factorization
1 : Lawrence Berkeley National Laboratory
(LBNL)
-
Website
Lawrence Berkeley National Lab MS 50F Cyclotron Rd., Berkeley, CA 94720 -
United States
In this work, we study various scheduling approaches for Sparse Cholesky factorization. We review different algorithms based on a distributed memory implementation of the Fan-Both algorithm. We also study different communication mechanisms and dynamic scheduling techniques.
| Subject : | : | oral |
| Topics | : | Applications (Linear algebra) |
| PDF version | : |  PDF version |
- Presentation
