Task-Parallel LU Factorization of Hierarchical Matrices Using OmpSs
Task-parallelism has been exposed as an efficient approach for the solution of dense and sparse linear algebra problems. Hierarchical matrices lie in-between the dense and sparse scenarios and, therefore, it is natural to target this niche of problems via a runtime-based solution that has reported s...
Uložené v:
| Vydané v: | 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) s. 1148 - 1157 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.05.2017
|
| Predmet: | |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Task-parallelism has been exposed as an efficient approach for the solution of dense and sparse linear algebra problems. Hierarchical matrices lie in-between the dense and sparse scenarios and, therefore, it is natural to target this niche of problems via a runtime-based solution that has reported successful results in the recent past for related linear algebra problems. Concretely, in this paper we investigate the multithreaded parallelization of the LU factorization of hierarchical matrices using the OmpSs task-parallel programming model and runtime. The focus of our study is in the adoption of an efficient storage layout for this type of matrices, and the analysis of the consequences that this decision exerts on the detection of task dependencies, the programming effort, and the performance of the solution. |
|---|---|
| AbstractList | Task-parallelism has been exposed as an efficient approach for the solution of dense and sparse linear algebra problems. Hierarchical matrices lie in-between the dense and sparse scenarios and, therefore, it is natural to target this niche of problems via a runtime-based solution that has reported successful results in the recent past for related linear algebra problems. Concretely, in this paper we investigate the multithreaded parallelization of the LU factorization of hierarchical matrices using the OmpSs task-parallel programming model and runtime. The focus of our study is in the adoption of an efficient storage layout for this type of matrices, and the analysis of the consequences that this decision exerts on the detection of task dependencies, the programming effort, and the performance of the solution. |
| Author | Carratala-Saez, Rocio Aliaga, Jose I. Kriemann, Ronald Quintana-Orti, Enrique S. |
| Author_xml | – sequence: 1 givenname: Jose I. surname: Aliaga fullname: Aliaga, Jose I. email: aliaga@uji.es organization: Dipt. de Ing. y Cienc. de Comput., Univ. Jaume I, Castellon, Spain – sequence: 2 givenname: Rocio surname: Carratala-Saez fullname: Carratala-Saez, Rocio email: rcarrata@uji.es organization: Dipt. de Ing. y Cienc. de Comput., Univ. Jaume I, Castellon, Spain – sequence: 3 givenname: Ronald surname: Kriemann fullname: Kriemann, Ronald email: rok@mis.mpg.de organization: Max-Planck-Inst. for Math. in the Sci., Leipzig, Germany – sequence: 4 givenname: Enrique S. surname: Quintana-Orti fullname: Quintana-Orti, Enrique S. email: quintana@uji.es organization: Dipt. de Ing. y Cienc. de Comput., Univ. Jaume I, Castellon, Spain |
| BookMark | eNotzLFOwzAUQFEjwQClMwOLfyDFz3Yce0SB0kpBjdRGjNWz8wIWaVI5WeDrQYLpTufesMthHIixOxArAOEetvVTvX9bSQHFCqS-YEtXWMiVNUoLK65ZecDpM6sxYd9Tz6uGrzHMY4rfOMdx4GPHN5ESpvARA_b8FecUA028meLwznen8366ZVcd9hMt_7tgzfr5UG6yaveyLR-rLEoNc9Zq65GQXOcldeAVKKOD8srnujW5dgaCaXNvBYVWBYcdGCGdl9KoXxvUgt3_fSMRHc8pnjB9HQtncjBW_QCNbUeF |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/IPDPSW.2017.124 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9781538634080 1538634082 |
| EndPage | 1157 |
| ExternalDocumentID | 7965168 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-i241t-d48baeae9fb2ef1b31364c3b3b54d654961c6d5b80ecd3c9af16029b2263d48c3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000417418900124&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Thu Jun 29 18:38:09 EDT 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i241t-d48baeae9fb2ef1b31364c3b3b54d654961c6d5b80ecd3c9af16029b2263d48c3 |
| PageCount | 10 |
| ParticipantIDs | ieee_primary_7965168 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-05 |
| PublicationDateYYYYMMDD | 2017-05-01 |
| PublicationDate_xml | – month: 05 year: 2017 text: 2017-05 |
| PublicationDecade | 2010 |
| PublicationTitle | 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) |
| PublicationTitleAbbrev | IPDPSW |
| PublicationYear | 2017 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.6863831 |
| Snippet | Task-parallelism has been exposed as an efficient approach for the solution of dense and sparse linear algebra problems. Hierarchical matrices lie in-between... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1148 |
| SubjectTerms | Electronic mail Hierarchical matrices (H-matrices) Indexes LU factorization Matrix decomposition multicore processors OmpSs Partitioning algorithms Programming Software Task-Parallelism |
| Title | Task-Parallel LU Factorization of Hierarchical Matrices Using OmpSs |
| URI | https://ieeexplore.ieee.org/document/7965168 |
| WOSCitedRecordID | wos000417418900124&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEJ0A8eBJDRi_04NHC1v6sbtnlGCiuAkQuZG2O5sQEQgL_n7bskEPXrw1TSZNp2leP96bB3CvpDRGetkHWkGFQKTawSjNeSGk8aCU6GA2EQ-HyXSaZjV4OGhhEDGQz7Dtm-EvP1_ZnX8q68SpkkwldajHsdprtapqPSxKO8_ZYzZ692ytuM28gv2XXUpAi_7J_8Y5hdaP7I5kB0A5gxoum9Ab6_KDZnrjTU8W5GVC-sEip9JPklVBBnOvIg6mJgvyGmruY0kCGYC8fa5HZQsm_adxb0Ar5wM6d4i6pblIjEaNaWG6WDDDGVfCcsNdWnPlrnSKWZVLk0Roc25TXTAVdVPjzlLcxVp-Do3laokXQKxDqTwW1u1UKUwRaQdGLppxI4yVgl1C0ydgtt4Xt5hVc7_6u_sajn1-94y_G2hsNzu8hSP7tZ2Xm7uwIt-HYI73 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEJ0gmuhJDRi_7cGjC1v6we4ZJRABNwEiN9J2ZxMiAmHB329bNujBi7emyaTpNM3rx3vzAB6lEFoLJ_tAwwPOEQNlYTRIWcaFdqAUKW820RwMoskkTkrwtNfCIKInn2HNNf1ffro0W_dUVm_GUlAZHcCh4LwR7tRaRb0eGsb1bvKcDN8dX6tZo07D_sswxeNF-_R_I51B9Ud4R5I9pJxDCRcVaI1U_hEkau1sT-akNyZtb5JTKCjJMiOdmdMRe1uTOen7qvuYE08HIG-fq2FehXH7ZdTqBIX3QTCzmLoJUh5phQrjTDcwo5pRJrlhmtnEptJe6iQ1MhU6CtGkzMQqozJsxNqeppiNNewCyovlAi-BGItTaZMbu1cF11moLBzZaMo010ZwegUVl4DpalfeYlrM_frv7gc47oz6vWmvO3i9gROX6x3_7xbKm_UW7-DIfG1m-frer843JzSSPg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2017+IEEE+International+Parallel+and+Distributed+Processing+Symposium+Workshops+%28IPDPSW%29&rft.atitle=Task-Parallel+LU+Factorization+of+Hierarchical+Matrices+Using+OmpSs&rft.au=Aliaga%2C+Jose+I.&rft.au=Carratala-Saez%2C+Rocio&rft.au=Kriemann%2C+Ronald&rft.au=Quintana-Orti%2C+Enrique+S.&rft.date=2017-05-01&rft.pub=IEEE&rft.spage=1148&rft.epage=1157&rft_id=info:doi/10.1109%2FIPDPSW.2017.124&rft.externalDocID=7965168 |