In EDS ansehen

Algebraic Block Multi-Color Ordering Method for Parallel Multi-Threaded Sparse Triangular Solver in ICCG Method.

Gespeichert in:
Bibliographische Detailangaben
Titel: Algebraic Block Multi-Color Ordering Method for Parallel Multi-Threaded Sparse Triangular Solver in ICCG Method.
Autoren: Iwashita, Takeshi, Nakashima, Hiroshi, Takahashi, Yasuhito
Quelle: 2012 IEEE 26th International Parallel & Distributed Processing Symposium; 1/ 1/2012, p474-483, 10p
Abstract: This paper covers the multi-threaded parallel processing of a sparse triangular solver for a linear system with a sparse coefficient matrix, focusing on its application to a parallel ICCG solver. We propose algebraic block multi-color ordering, which is an enhanced version of block multi-color ordering for general unstructured analysis. We present blocking and coloring strategies that achieve a high cache hit ratio and fast convergence. Five numerical tests on a shared memory parallel computer verify that the computation time of the proposed method is between 1.7 and 2.6 times faster than that of the conventional multi-color ordering method. [ABSTRACT FROM PUBLISHER]
Copyright of 2012 IEEE 26th International Parallel & Distributed Processing Symposium is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Datenbank: Complementary Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edb&genre=book&issn=&ISBN=9781467309752&volume=&issue=&date=&spage=474&pages=474-483&title=2012 IEEE 26th International Parallel & Distributed Processing Symposium&atitle=Algebraic%20Block%20Multi-Color%20Ordering%20Method%20for%20Parallel%20Multi-Threaded%20Sparse%20Triangular%20Solver%20in%20ICCG%20Method.&aulast=Iwashita%2C%20Takeshi&id=DOI:10.1109/IPDPS.2012.51
    Name: Full Text Finder
    Category: fullText
    Text: Full Text Finder
    Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif
    MouseOverText: Full Text Finder
Header DbId: edb
DbLabel: Complementary Index
An: 86539773
RelevancyScore: 849
AccessLevel: 6
PubType: Conference
PubTypeId: conference
PreciseRelevancyScore: 849.323059082031
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Algebraic Block Multi-Color Ordering Method for Parallel Multi-Threaded Sparse Triangular Solver in ICCG Method.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Iwashita%2C+Takeshi%22">Iwashita, Takeshi</searchLink><br /><searchLink fieldCode="AR" term="%22Nakashima%2C+Hiroshi%22">Nakashima, Hiroshi</searchLink><br /><searchLink fieldCode="AR" term="%22Takahashi%2C+Yasuhito%22">Takahashi, Yasuhito</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: 2012 IEEE 26th International Parallel & Distributed Processing Symposium; 1/ 1/2012, p474-483, 10p
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper covers the multi-threaded parallel processing of a sparse triangular solver for a linear system with a sparse coefficient matrix, focusing on its application to a parallel ICCG solver. We propose algebraic block multi-color ordering, which is an enhanced version of block multi-color ordering for general unstructured analysis. We present blocking and coloring strategies that achieve a high cache hit ratio and fast convergence. Five numerical tests on a shared memory parallel computer verify that the computation time of the proposed method is between 1.7 and 2.6 times faster than that of the conventional multi-color ordering method. [ABSTRACT FROM PUBLISHER]
– Name: Abstract
  Label:
  Group: Ab
  Data: <i>Copyright of 2012 IEEE 26th International Parallel & Distributed Processing Symposium is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=86539773
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1109/IPDPS.2012.51
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 10
        StartPage: 474
    Titles:
      – TitleFull: Algebraic Block Multi-Color Ordering Method for Parallel Multi-Threaded Sparse Triangular Solver in ICCG Method.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Iwashita, Takeshi
      – PersonEntity:
          Name:
            NameFull: Nakashima, Hiroshi
      – PersonEntity:
          Name:
            NameFull: Takahashi, Yasuhito
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Text: 1/ 1/2012
              Type: published
              Y: 2012
          Identifiers:
            – Type: isbn-print
              Value: 9781467309752
          Titles:
            – TitleFull: 2012 IEEE 26th International Parallel & Distributed Processing Symposium
              Type: main
ResultId 1