Optimal Parallel Scheduling of Gaussian Elimination DAG's
DOI10.1109/TC.1983.1676171zbMATH Open0524.68020MaRDI QIDQ3036696FDOQ3036696
Authors: Mandayam A. Srinivas
Publication date: 1983
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Recommendations
Gaussian eliminationparallel algorithmparallel computationschedulingdirected acyclic graphsdense matrices
Direct numerical methods for linear systems and matrix inversion (65F05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel algorithms in computer science (68W10)
Cited In (13)
- An optimal schedule for Gaussian elimination on an MIMD architecture
- A survey of direct methods for sparse linear systems
- Lessa: an array to solve a aet of linear equations
- PCR algorithm for parallel computing the solution of the general restricted linear equations
- Parallel solution of dense linear systems using diagonalization methods
- Title not available (Why is that?)
- Optimal scheduling algorithms for parallel Gaussian elimination
- Title not available (Why is that?)
- Design and implementation of a parallel Markowitz threshold algorithm
- Title not available (Why is that?)
- Assignment and scheduling in parallel matrix factorization
- Advantages for solving linear systems in an asynchronous environment
- A new algorithm for parallel solution of linear equations
This page was built for publication: Optimal Parallel Scheduling of Gaussian Elimination DAG's
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3036696)