Computational models and task scheduling for parallel sparse Cholesky factorization
- 1 October 1986
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 3 (4), 327-342
- https://doi.org/10.1016/0167-8191(86)90014-1
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- A compact row storage scheme for Cholesky factors using elimination treesACM Transactions on Mathematical Software, 1986
- Parallel pivoting algorithms for sparse symmetric matricesParallel Computing, 1984
- Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline MachineSIAM Review, 1984
- An Efficient Parallel Algorithm for the Solution of Large Sparse Linear Matrix EquationsIEEE Transactions on Computers, 1983
- A Data Structure for Parallel L/U DecompositionIEEE Transactions on Computers, 1982
- Deterministic Processor SchedulingACM Computing Surveys, 1977
- A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor SystemsIEEE Transactions on Computers, 1975
- A comparison of list schedules for parallel processing systemsCommunications of the ACM, 1974
- An Almost-Optimal Algorithm for the Assembly Line Scheduling ProblemIEEE Transactions on Computers, 1974
- Parallel Sequencing and Assembly Line ProblemsOperations Research, 1961