Optimal Parallel Scheduling of Gaussian Elimination DAG's

DOI10.1109/TC.1983.1676171zbMath0524.68020MaRDI QIDQ3036696

Mandayam A. Srinivas

Publication date: 1983

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

schedulingparallel computationGaussian eliminationparallel algorithmdense matricesdirected acyclic graphs

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (9)

A new algorithm for parallel solution of linear equations ⋮ Design and Implementation of a Parallel Markowitz Threshold Algorithm ⋮ Lessa: an array to solve a aet of linear equations ⋮ Parallel solution of dense linear systems using diagonalization methods ⋮ PCR algorithm for parallel computing the solution of the general restricted linear equations ⋮ A survey of direct methods for sparse linear systems ⋮ An optimal schedule for Gaussian elimination on an MIMD architecture ⋮ Advantages for solving linear systems in an asynchronous environment ⋮ Assignment and scheduling in parallel matrix factorization

This page was built for publication: Optimal Parallel Scheduling of Gaussian Elimination DAG's