• DocumentCode
    2034695
  • Title

    Supernodal Sparse Cholesky Factorization on Distributed-Memory Multiprocessors

  • Author

    Eswar, Kalluri ; Sadayappan, P. ; Huang, Chua-Huang ; Visvanathan, V.

  • Author_Institution
    The Ohio State University, USA
  • Volume
    3
  • fYear
    1993
  • fDate
    16-20 Aug. 1993
  • Firstpage
    18
  • Lastpage
    22
  • Abstract
    The concept of supernodes has been widely used in the design of algorithms for the solution of sparse linear systems of equations. This paper discusses the use of supernodes in the design of algorithms for sparse Cholesky factorization on distributed-memory multiprocessors. A new algorithm that is communication efficient, has good load balance, and benefits significantly from supernodes is presented.
  • Keywords
    Algorithm design and analysis; Equations; Information science; Linear systems; Parallel processing; Performance analysis; Sparse matrices; Supercomputers; Taxonomy; Workstations;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing, 1993. ICPP 1993. International Conference on
  • Conference_Location
    Syracuse, NY, USA
  • ISSN
    0190-3918
  • Print_ISBN
    0-8493-8983-6
  • Type

    conf

  • DOI
    10.1109/ICPP.1993.170
  • Filename
    4134240
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2034695