Task scheduling for parallel sparse Cholesky factorization

DOI10.1007/BF01407861MaRDI QIDQ915427zbMATH OpenFDO

Authors Elsie Sterbin Gottlieb

Publication date 1989

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

Full work available at URL https://doi.org/10.1007/BF01407861

zbMATH Keywords

elimination treesfinite-element problemsmultiprocessor systemparallel computingsparse Cholesky factorizationsubtree to subcube mappingtask scheduling

Mathematics Subject Classification ID

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

Recommendations

• Computational models and task scheduling for parallel sparse Cholesky factorization
• scientific article; zbMATH DE number 833696
• scientific article; zbMATH DE number 833702
• Highly Parallel Sparse Cholesky Factorization
• scientific article; zbMATH DE number 1760069
• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• A Mapping Algorithm for Parallel Sparse Cholesky Factorization
• scientific article; zbMATH DE number 741181
• scientific article; zbMATH DE number 1302627
• Assignment and scheduling in parallel matrix factorization

Cites work

• A compact row storage scheme for Cholesky factors using elimination trees
• A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
• A parallel graph partitioning algorithm for a message-passing multiprocessor
• An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
• Communication results for parallel sparse Cholesky factorization on a hypercube
• scientific article; zbMATH DE number 4190981 (Why is no real title available?)
• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Modification of the minimum-degree algorithm by multiple elimination
• Nested Dissection of a Regular Finite Element Mesh
• Parallel implementation of multifrontal schemes
• Reordering sparse matrices for parallel elimination
• Solution of sparse positive definite systems on a hypercube
• Solution of sparse positive definite systems on a shared-memory multiprocessor
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• The Evolution of the Minimum Degree Ordering Algorithm
• The Role of Elimination Trees in Sparse Factorization

Cited in

(13)

• Assignment and scheduling in parallel matrix factorization
• Computational models and task scheduling for parallel sparse Cholesky factorization
• Multifrontal parallel distributed symmetric and unsymmetric solvers
• Scheduling trees of malleable tasks for sparse linear algebra
• Experiments with sparse Cholesky using a sequential task-flow implementation
• A Mapping Algorithm for Parallel Sparse Cholesky Factorization
• Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver
• scientific article; zbMATH DE number 833696 (Why is no real title available?)
• 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
• Computational Science – ICCS 2005
• A survey of direct methods for sparse linear systems

Describes a project that uses

Uses Software

• symrcm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915427)