Zobrazit v EDS

Using analysis information in the synchronization‐free GPU solution of sparse triangular systems.

Uloženo v:
Podrobná bibliografie
Název: Using analysis information in the synchronization‐free GPU solution of sparse triangular systems.
Autoři: Dufrechou, Ernesto, Ezzatti, Pablo
Zdroj: Concurrency & Computation: Practice & Experience; 5/25/2020, Vol. 32 Issue 10, p1-11, 11p
Témata: SPARSE matrices, LINEAR systems, GRAPHICS processing units, SYNCHRONIZATION
Abstrakt: Summary: The solution of sparse triangular linear systems is one of the most important building blocks for a large number of science and engineering problems. For these reasons, it has been studied steadily for several decades, principally in order to take advantage of emerging parallel platforms. In the context of massively parallel platforms such as GPUs, the standard strategy of parallel solution is based on performing a level‐set analysis of the sparse matrix, and the kernel included in the nVidia cuSparse library is the most prominent example of this approach. However, a weak spot of this implementation is the costly analysis phase and the constant synchronizations with the CPU during the solution stage. In previous work, we presented a self‐scheduled and synchronization‐free GPU algorithm that avoided the analysis phase and the synchronizations of the standard approach. Here, we extend this proposal and show how the level‐set information can be leveraged to improve its performance. In particular, we present new GPU solution routines that attack some of the weak spots of the self‐scheduled solver, such as the under‐utilization of the GPU resources in the case of highly sparse matrices. The experimental evaluation reveals a sensible runtime reduction over cuSparse and the state‐of‐the‐art synchronization‐free method. [ABSTRACT FROM AUTHOR]
Copyright of Concurrency & Computation: Practice & Experience is the property of Wiley-Blackwell 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.)
Databáze: Complementary Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edb&genre=article&issn=15320626&ISBN=&volume=32&issue=10&date=20200525&spage=1&pages=1-11&title=Concurrency & Computation: Practice & Experience&atitle=Using%20analysis%20information%20in%20the%20synchronization%E2%80%90free%20GPU%20solution%20of%20sparse%20triangular%20systems.&aulast=Dufrechou%2C%20Ernesto&id=DOI:10.1002/cpe.5499
    Name: Full Text Finder
    Category: fullText
    Text: Full Text Finder
    Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif
    MouseOverText: Full Text Finder
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Dufrechou%20E
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edb
DbLabel: Complementary Index
An: 142792861
RelevancyScore: 900
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 899.605651855469
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Using analysis information in the synchronization‐free GPU solution of sparse triangular systems.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Dufrechou%2C+Ernesto%22">Dufrechou, Ernesto</searchLink><br /><searchLink fieldCode="AR" term="%22Ezzatti%2C+Pablo%22">Ezzatti, Pablo</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: Concurrency & Computation: Practice & Experience; 5/25/2020, Vol. 32 Issue 10, p1-11, 11p
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22SPARSE+matrices%22">SPARSE matrices</searchLink><br /><searchLink fieldCode="DE" term="%22LINEAR+systems%22">LINEAR systems</searchLink><br /><searchLink fieldCode="DE" term="%22GRAPHICS+processing+units%22">GRAPHICS processing units</searchLink><br /><searchLink fieldCode="DE" term="%22SYNCHRONIZATION%22">SYNCHRONIZATION</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Summary: The solution of sparse triangular linear systems is one of the most important building blocks for a large number of science and engineering problems. For these reasons, it has been studied steadily for several decades, principally in order to take advantage of emerging parallel platforms. In the context of massively parallel platforms such as GPUs, the standard strategy of parallel solution is based on performing a level‐set analysis of the sparse matrix, and the kernel included in the nVidia cuSparse library is the most prominent example of this approach. However, a weak spot of this implementation is the costly analysis phase and the constant synchronizations with the CPU during the solution stage. In previous work, we presented a self‐scheduled and synchronization‐free GPU algorithm that avoided the analysis phase and the synchronizations of the standard approach. Here, we extend this proposal and show how the level‐set information can be leveraged to improve its performance. In particular, we present new GPU solution routines that attack some of the weak spots of the self‐scheduled solver, such as the under‐utilization of the GPU resources in the case of highly sparse matrices. The experimental evaluation reveals a sensible runtime reduction over cuSparse and the state‐of‐the‐art synchronization‐free method. [ABSTRACT FROM AUTHOR]
– Name: Abstract
  Label:
  Group: Ab
  Data: <i>Copyright of Concurrency & Computation: Practice & Experience is the property of Wiley-Blackwell 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=142792861
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1002/cpe.5499
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 1
    Subjects:
      – SubjectFull: SPARSE matrices
        Type: general
      – SubjectFull: LINEAR systems
        Type: general
      – SubjectFull: GRAPHICS processing units
        Type: general
      – SubjectFull: SYNCHRONIZATION
        Type: general
    Titles:
      – TitleFull: Using analysis information in the synchronization‐free GPU solution of sparse triangular systems.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Dufrechou, Ernesto
      – PersonEntity:
          Name:
            NameFull: Ezzatti, Pablo
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 25
              M: 05
              Text: 5/25/2020
              Type: published
              Y: 2020
          Identifiers:
            – Type: issn-print
              Value: 15320626
          Numbering:
            – Type: volume
              Value: 32
            – Type: issue
              Value: 10
          Titles:
            – TitleFull: Concurrency & Computation: Practice & Experience
              Type: main
ResultId 1