Assignment and scheduling in parallel matrix factorization

DOI10.1016/0024-3795(86)90172-2zbMath0587.65014OpenAlexW1982983417MaRDI QIDQ1072330

Dianne P. O'Leary, G. W. Stewart

Publication date: 1986

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(86)90172-2

zbMATH Keywords

LU factorizationQR factorizationscheduling algorithmsCholesky factorizationsMIMD processors

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (2)

A parallel boundary element formulation for determining effective properties of heterogeneous media ⋮ Avoiding the square-root bottleneck in the Choleski factorization of a matrix on a parallel computer

Cites Work

• Unnamed Item
• Parallel Cholesky factorization on a shared-memory multiprocessor
• Torus data flow for parallel computation of missized matrix problems
• Complexity of dense-linear-system solution on a multiprocessor ring
• Optimal Parallel Scheduling of Gaussian Elimination DAG's
• Data-flow algorithms for parallel matrix computation

This page was built for publication: Assignment and scheduling in parallel matrix factorization