Impact of communications of the complexity of the parallel Gaussian elimination
From MaRDI portal
Publication:2277765
DOI10.1016/S0167-8191(05)80017-1zbMath0725.65030MaRDI QIDQ2277765
Evripidis Bampis, Denis Trystram, Jean-Claude Konig
Publication date: 1991
Published in: Parallel Computing (Search for Journal in Brave)
complexityGaussian eliminationparallel algorithmsscheduling algorithmshared-memory systemMIMD computers
Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (3)
Some models for scheduling parallel programs with communication delays ⋮ Minimizing the schedule length for a parallel 3D-grid precedence graph ⋮ An optimal schedule for Gaussian elimination on an MIMD architecture
This page was built for publication: Impact of communications of the complexity of the parallel Gaussian elimination
