An efficient load-balancing processor scheduling algorithm for parallelization of Gauss-Seidel type algorithms

DOI10.1006/JPDC.1994.1095zbMATH Open0817.65027OpenAlexW2083094116MaRDI QIDQ1344545FDOQ1344545

Authors: V. Pereyra 

Publication date: 6 August 1995

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1994.1095

Recommendations

• Comments on scheduling parallel iterative methods on multiprocessor systems
• Comments on scheduling parallel iterative methods on multiprocessor systems. II
• A distributed memory parallel Gauss-seidel algorithm for linear algebraic systems
• A Set of New Mapping and Coloring Heuristics for Distributed-Memory Parallel Processors
• Scheduling parallel iterative methods on multiprocessor systems

zbMATH Keywords

convergenceparallel computationcoloring problemheuristic methodGauss-Seidel algorithmload-balancing processor scheduling algorithmpower flow analysis

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10)

Cited In (2)

• Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling
• Static Scheduling with Load Balancing for Solving Triangular Band Linear Systems on Multicore Processors

This page was built for publication: An efficient load-balancing processor scheduling algorithm for parallelization of Gauss-Seidel type algorithms

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