Coarse Grain Scheduling in pakallel triangular Factorization and Solution of Power System Matrices

Kawah Lau, Daniel Tylavsky, Anjan Bose

Research output: Contribution to journalArticle

31 Scopus citations

Abstract

Triangular (LU) factorization has long been a widely used method for solving sparse linear matrix equations arising from power system analysis problems in the industry. Recent interest has been shown in parallel processing in order to further improve the speed of solution of the linear matrix equation. Parallel triangular factorization scheduling using two fast coarse grain scheduling schemes is presented in this paper along with performance results obtained using the iPSC hypercube parallel processing computer. The study shows that the solution of the parallel LU factorization problem using different coarse grain scheduling schemes on a coarse grain parallel processing computer can have widely varying performance results.

Original languageEnglish (US)
Pages (from-to)708-714
Number of pages7
JournalIEEE Transactions on Power Systems
Volume6
Issue number2
DOIs
StatePublished - Jan 1 1991

    Fingerprint

ASJC Scopus subject areas

  • Energy Engineering and Power Technology
  • Electrical and Electronic Engineering

Cite this