• DocumentCode
    3239687
  • Title

    A New Scheduling Algorithm for Parallel Sparse LU Factorization with Static Pivoting

  • Author

    Grigori, Laura ; Li, Xiaoye S.

  • Author_Institution
    Lawrence Berkeley National Laboratory
  • fYear
    2002
  • fDate
    16-22 Nov. 2002
  • Firstpage
    25
  • Lastpage
    25
  • Abstract
    In this paper we present a static scheduling algorithm for parallel sparse LU factorization with static pivoting. The algorithm is divided into mapping and scheduling phases, using the symmetric pruned graphs of LT and U to represent dependencies. The scheduling algorithm is designed for driving the parallel execution of the factorization on a distributed-memory architecture. Experimental results and comparisons with SuperLU_DIST are reported after applying this algorithm on real world application matrices on an IBM SP RS/6000 distributed memory machine.
  • Keywords
    Algorithm design and analysis; Cyclotrons; Data structures; Laboratories; Numerical stability; Partitioning algorithms; Scheduling algorithm; Sparse matrices; Sun; Symmetric matrices;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Supercomputing, ACM/IEEE 2002 Conference
  • ISSN
    1063-9535
  • Print_ISBN
    0-7695-1524-X
  • Type

    conf

  • DOI
    10.1109/SC.2002.10032
  • Filename
    1592861
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3239687