Task scheduling for parallel sparse Cholesky factorization

DOI10.1007/BF01407861zbMath0702.68031MaRDI QIDQ915427

Elsie Sterbin Gottlieb

Publication date: 1989

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

zbMATH Keywords

parallel computingsparse Cholesky factorizationtask schedulingmultiprocessor systemelimination treesfinite-element problemssubtree to subcube mapping

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (6)

Experiments with sparse Cholesky using a sequential task-flow implementation ⋮ A survey of direct methods for sparse linear systems ⋮ Multifrontal parallel distributed symmetric and unsymmetric solvers ⋮ Parallel Computation of Entries of ${A}^{-1}$ ⋮ A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling ⋮ Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel implementation of multifrontal schemes
• Solution of sparse positive definite systems on a shared-memory multiprocessor
• A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
• A parallel graph partitioning algorithm for a message-passing multiprocessor
• Reordering sparse matrices for parallel elimination
• Solution of sparse positive definite systems on a hypercube
• Communication results for parallel sparse Cholesky factorization on a hypercube
• The Role of Elimination Trees in Sparse Factorization
• Modification of the minimum-degree algorithm by multiple elimination
• A compact row storage scheme for Cholesky factors using elimination trees
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• The Evolution of the Minimum Degree Ordering Algorithm
• An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
• Nested Dissection of a Regular Finite Element Mesh

This page was built for publication: Task scheduling for parallel sparse Cholesky factorization