An efficient load-balancing processor scheduling algorithm for parallelization of gauss-seidel type algorithms

Garng Morton Huang, W. Ongsakul

Research output: Contribution to journalArticle

1 Citation (Scopus)


The paper extends our earlier results on the parallelization of Gauss-Seidel (G-S) algorithms for power flow analysis. In the earlier paper, we formulate the parallelizing process as a basic coloring problem, which satisfies the constraint that no directly connected vertices have the same color, without worrying about the constraint on the number of available processors. In this paper, this extra constraint is considered. A heuristic approach is developed to maximize the processor efficiency under the number of processor constraint. The idea is to fully utilize the processor resource, to balance the computational load, and to maximize the use of newly computed data for faster convergence. Some examples and test results are described in this paper.

Original languageEnglish
Pages (from-to)350-358
Number of pages9
JournalJournal of Parallel and Distributed Computing
Issue number2
Publication statusPublished - 1 Jan 1994
Externally publishedYes


ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this