The Chunks and Tasks Matrix Library
We present a C++ header-only parallel sparse matrix library, based on sparse quadtree representation of matrices using the Chunks and Tasks programming model. The library implements a number of sparse matrix algorithms for distributed memory parallelization that are able to dynamically exploit data...
Saved in:
| Published in: | SoftwareX Vol. 19; p. 101159 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
01.07.2022
Elsevier |
| Subjects: | |
| ISSN: | 2352-7110, 2352-7110 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We present a C++ header-only parallel sparse matrix library, based on sparse quadtree representation of matrices using the Chunks and Tasks programming model. The library implements a number of sparse matrix algorithms for distributed memory parallelization that are able to dynamically exploit data locality to avoid movement of data. This is demonstrated for the example of block-sparse matrix–matrix multiplication applied to three sequences of matrices with different nonzero structure, using the CHT-MPI 2.0 runtime library implementation of the Chunks and Tasks model. The runtime library succeeds to dynamically load balance the calculation regardless of the sparsity structure. |
|---|---|
| AbstractList | We present a C++ header-only parallel sparse matrix library, based on sparse quadtree representation of matrices using the Chunks and Tasks programming model. The library implements a number of sparse matrix algorithms for distributed memory parallelization that are able to dynamically exploit data locality to avoid movement of data. This is demonstrated for the example of block-sparse matrix–matrix multiplication applied to three sequences of matrices with different nonzero structure, using the CHT-MPI 2.0 runtime library implementation of the Chunks and Tasks model. The runtime library succeeds to dynamically load balance the calculation regardless of the sparsity structure. We present a C++ header-only parallel sparse matrix library, based on sparse quadtree representation of matrices using the Chunks and Tasks programming model. The library implements a number of sparse matrix algorithms for distributed memory parallelization that are able to dynamically exploit data locality to avoid movement of data. This is demonstrated for the example of block-sparse matrix-matrix multiplication applied to three sequences of matrices with different nonzero structure, using the CHT-MPI 2.0 runtime library implementation of the Chunks and Tasks model. The runtime library succeeds to dynamically load balance the calculation regardless of the sparsity structure. |
| ArticleNumber | 101159 |
| Author | Rudberg, Elias Kruchinina, Anastasia Artemov, Anton G. Rubensson, Emanuel H. |
| Author_xml | – sequence: 1 givenname: Emanuel H. orcidid: 0000-0002-7686-2075 surname: Rubensson fullname: Rubensson, Emanuel H. email: emanuel.rubensson@it.uu.se – sequence: 2 givenname: Elias orcidid: 0000-0003-4145-6816 surname: Rudberg fullname: Rudberg, Elias – sequence: 3 givenname: Anastasia orcidid: 0000-0002-2019-1452 surname: Kruchinina fullname: Kruchinina, Anastasia – sequence: 4 givenname: Anton G. orcidid: 0000-0002-6333-6869 surname: Artemov fullname: Artemov, Anton G. |
| BackLink | https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-426148$$DView record from Swedish Publication Index (Uppsala universitet) |
| BookMark | eNp9kD1PwzAQhi1UJErpL2CJxEqLfbEdZ2CoyqdUxFJYLcd2qENJKjuB8u9xG4RgYbrT6d7nTs8xGtRNbRE6JXhKMOEX1TQ0ZbudAgbYTQjLD9AQUgaTjBA8-NUfoXEIFcaYMBAM6BCdLVc2ma-6-jUkqjbJUoXYPajWu22ycIVX_vMEHZZqHez4u47Q0831cn43WTze3s9ni4mmmLQTUxjCLctLgYEbDlQQyzQUqeYYG2JLrmmmhBbxepFlZSZSprVQnFrKKGbpCN33XNOoSm68e4vHZaOc3A8a_yKVb51eWwmCU2GgAEo01UoXpc4EU5ATijnOIbLOe1b4sJuu-EO7cs-zPa3rJAVOqIjrab-ufROCt-VPgGC5sywrubcsd5ZlbzmmLvuUjVbenfUyaGdrbY3zVrfxbfdv_gsfYYU8 |
| Cites_doi | 10.1016/j.parco.2014.03.012 10.1021/acs.jctc.5b00382 10.1016/j.jcp.2021.110354 10.1145/77626.79170 10.1137/S0036144503428693 10.1021/ct200897x 10.1063/1.3492379 10.1109/TPDS.2021.3094091 10.1016/j.parco.2013.09.006 10.1137/110848244 10.1016/j.parco.2016.06.005 10.1002/jcc.20691 10.1177/1094342011403516 10.1021/ct900543q 10.1137/15M104253X 10.1016/j.parco.2019.102548 10.1016/j.cpc.2017.12.010 10.1145/1089389.1089398 10.1088/0034-4885/75/3/036503 10.1093/imanum/drz075 10.1145/3322125 10.1002/(SICI)1096-9128(199704)9:4<255::AID-CPE250>3.0.CO;2-2 |
| ContentType | Journal Article |
| Copyright | 2022 The Authors |
| Copyright_xml | – notice: 2022 The Authors |
| DBID | 6I. AAFTH AAYXX CITATION ACNBI ADTPV AOWAS D8T DF2 ZZAVC DOA |
| DOI | 10.1016/j.softx.2022.101159 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef SWEPUB Uppsala universitet full text SwePub SwePub Articles SWEPUB Freely available online SWEPUB Uppsala universitet SwePub Articles full text Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ - Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 2352-7110 |
| ExternalDocumentID | oai_doaj_org_article_28648d2b241c4cacbfc785a291406092 oai_DiVA_org_uu_426148 10_1016_j_softx_2022_101159 S2352711022000991 |
| GroupedDBID | 0R~ 0SF 457 5VS 6I. AACTN AAEDW AAFTH AALRI AAXUO ABMAC ACGFS ADBBV ADEZE AEXQZ AFTJW AGHFR AITUG ALMA_UNASSIGNED_HOLDINGS AMRAJ BCNDV EBS EJD FDB GROUPED_DOAJ IPNFZ IXB KQ8 M~E NCXOZ O9- OK1 RIG ROL SSZ AAYWO AAYXX ACVFH ADCNI ADVLN AEUPX AFJKZ AFPUW AIGII AKBMS AKRWK AKYEP APXCP CITATION ACNBI ADTPV AOWAS D8T DF2 ZZAVC |
| ID | FETCH-LOGICAL-c401t-dbd16e59f8026d62481e5c2b3c600d1ef6c47a8c8015b77f7835cc8a64e454053 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000879382700003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2352-7110 |
| IngestDate | Fri Oct 03 12:46:38 EDT 2025 Tue Nov 04 16:35:27 EST 2025 Thu Nov 13 04:24:03 EST 2025 Wed May 17 00:25:40 EDT 2023 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Quadtree Task-based programming Block-sparse Sparse matrices Parallelization Chunks and Tasks programming model |
| Language | English |
| License | This is an open access article under the CC BY license. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c401t-dbd16e59f8026d62481e5c2b3c600d1ef6c47a8c8015b77f7835cc8a64e454053 |
| ORCID | 0000-0002-7686-2075 0000-0003-4145-6816 0000-0002-2019-1452 0000-0002-6333-6869 |
| OpenAccessLink | https://doaj.org/article/28648d2b241c4cacbfc785a291406092 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_28648d2b241c4cacbfc785a291406092 swepub_primary_oai_DiVA_org_uu_426148 crossref_primary_10_1016_j_softx_2022_101159 elsevier_sciencedirect_doi_10_1016_j_softx_2022_101159 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-07-01 |
| PublicationDateYYYYMMDD | 2022-07-01 |
| PublicationDate_xml | – month: 07 year: 2022 text: 2022-07-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | SoftwareX |
| PublicationYear | 2022 |
| Publisher | Elsevier B.V Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier |
| References | Azad, Selvitopi, Hussain, Gilbert, Buluç (b29) 2022; 33 (b8) 2020 Rubensson, Artemov, Kruchinina, Rudberg (b18) 2020; 41 Rubensson, Rudberg (b14) 2016; 57 Xianyi (b25) 2020 Buluç, Gilbert (b26) 2011; 25 Rubensson, Rudberg (b15) 2014; 40 Chetlur, Woolley, Vandermersch, Cohen, Tran, Catanzaro (b3) 2014 Weber, Laino, Pozdneev, va, Curioni (b10) 2015; 11 Artemov, Rudberg, Rubensson (b19) 2019; 89 VandeVondele, Borštnik, Hutter (b27) 2012; 8 Davis (b2) 2019; 45 Elmroth, Gustavson, Jonsson, Kågström (b6) 2004; 46 Dongarra, Du Croz, Hammarling, Duff (b21) 1990; 16 Derler, Zayer, Seidel, Steinberger (b24) 2017 Kruchinina, Rudberg, Rubensson (b20) 2019 Wise (b22) 1984; 18 Olivares-Amaya, Watson, Edgar, Vogt, Shao, Aspuru-Guzik (b5) 2010; 6 Artemov (b16) 2019 Rubensson, Rudberg, Sałek (b23) 2007; 28 Artemov, Rubensson (b17) 2021; 438 Van De Geijn, Watts (b7) 1997; 9 Dawson, Nakajima (b30) 2018; 225 Bowler, Miyazaki (b4) 2012; 75 Azad, Ballard, Buluç, Demmel, Grigori, Schwartz (b11) 2016; 38 Gao, Ji, Tan, Zhao (b1) 2020 Hine, Haynes, Mostofi, Payne (b9) 2010; 133 Ballard, Buluç, Demmel, Grigori, Lipshitz, Schwartz (b28) 2013 Buluç, Gilbert (b13) 2012; 34 Borštnik, VandeVondele, Weber, Hutter (b12) 2014; 40 Rubensson (10.1016/j.softx.2022.101159_b14) 2016; 57 Artemov (10.1016/j.softx.2022.101159_b16) 2019 Elmroth (10.1016/j.softx.2022.101159_b6) 2004; 46 Artemov (10.1016/j.softx.2022.101159_b17) 2021; 438 Borštnik (10.1016/j.softx.2022.101159_b12) 2014; 40 Van De Geijn (10.1016/j.softx.2022.101159_b7) 1997; 9 Xianyi (10.1016/j.softx.2022.101159_b25) 2020 Kruchinina (10.1016/j.softx.2022.101159_b20) 2019 Azad (10.1016/j.softx.2022.101159_b11) 2016; 38 Buluç (10.1016/j.softx.2022.101159_b26) 2011; 25 Olivares-Amaya (10.1016/j.softx.2022.101159_b5) 2010; 6 (10.1016/j.softx.2022.101159_b8) 2020 Derler (10.1016/j.softx.2022.101159_b24) 2017 Davis (10.1016/j.softx.2022.101159_b2) 2019; 45 Rubensson (10.1016/j.softx.2022.101159_b23) 2007; 28 Dawson (10.1016/j.softx.2022.101159_b30) 2018; 225 VandeVondele (10.1016/j.softx.2022.101159_b27) 2012; 8 Weber (10.1016/j.softx.2022.101159_b10) 2015; 11 Gao (10.1016/j.softx.2022.101159_b1) 2020 Chetlur (10.1016/j.softx.2022.101159_b3) 2014 Hine (10.1016/j.softx.2022.101159_b9) 2010; 133 Ballard (10.1016/j.softx.2022.101159_b28) 2013 Rubensson (10.1016/j.softx.2022.101159_b15) 2014; 40 Wise (10.1016/j.softx.2022.101159_b22) 1984; 18 Buluç (10.1016/j.softx.2022.101159_b13) 2012; 34 Dongarra (10.1016/j.softx.2022.101159_b21) 1990; 16 Artemov (10.1016/j.softx.2022.101159_b19) 2019; 89 Azad (10.1016/j.softx.2022.101159_b29) 2022; 33 Bowler (10.1016/j.softx.2022.101159_b4) 2012; 75 Rubensson (10.1016/j.softx.2022.101159_b18) 2020; 41 |
| References_xml | – volume: 25 start-page: 496 year: 2011 end-page: 509 ident: b26 article-title: The combinatorial BLAS: design, implementation, and applications publication-title: Int J High Perform C – year: 2014 ident: b3 article-title: cuDNN: Efficient primitives for deep learning – volume: 89 year: 2019 ident: b19 article-title: Parallelization and scalability analysis of inverse factorization using the chunks and tasks programming model publication-title: Parallel Comput – year: 2020 ident: b1 article-title: A systematic survey of general sparse matrix-matrix multiplication – volume: 28 start-page: 2531 year: 2007 end-page: 2537 ident: b23 article-title: A hierarchic sparse matrix data structure for large-scale Hartree-Fock/Kohn-Sham calculations publication-title: J Comput Chem – volume: 75 year: 2012 ident: b4 article-title: O(N) methods in electronic structure calculations publication-title: Rep Progr Phys – year: 2019 ident: b20 article-title: Efficient computation of the density matrix with error control on distributed computer systems – start-page: 222 year: 2013 end-page: 231 ident: b28 article-title: Communication optimal parallel multiplication of sparse random matrices publication-title: Proceedings of the twenty-fifth annual ACM symposium on parallelism in algorithms and architectures – volume: 133 year: 2010 ident: b9 article-title: Linear-scaling density-functional simulations of charged point defects in Al2O3 using hierarchical sparse matrix algebra publication-title: J Chem Phys – volume: 40 start-page: 47 year: 2014 end-page: 58 ident: b12 article-title: Sparse matrix multiplication: The distributed block-compressed sparse row library publication-title: Parallel Comput – volume: 46 start-page: 3 year: 2004 end-page: 45 ident: b6 article-title: Recursive blocked algorithms and hybrid data structures for dense matrix library software publication-title: SIAM Rev – year: 2017 ident: b24 article-title: Dynamic scheduling for efficient hierarchical sparse matrix operations on the GPU publication-title: Proceedings of the international conference on supercomputing – volume: 41 start-page: 729 year: 2020 end-page: 763 ident: b18 article-title: Localized inverse factorization publication-title: IMA J Numer Anal – volume: 45 year: 2019 ident: b2 article-title: Algorithm 1000: SuiteSparse:GraphBLAS: Graph algorithms in the language of sparse linear algebra publication-title: ACM Trans Math Software – volume: 57 start-page: 87 year: 2016 end-page: 106 ident: b14 article-title: Locality-aware parallel block-sparse matrix-matrix multiplication using the chunks and tasks programming model publication-title: Parallel Comput – volume: 225 start-page: 154 year: 2018 end-page: 165 ident: b30 article-title: Massively parallel sparse matrix function calculations with NTPoly publication-title: Comput Phys Comm – volume: 438 year: 2021 ident: b17 article-title: Sparse approximate matrix-matrix multiplication for density matrix purification with error control publication-title: J Comput Phys – volume: 6 start-page: 135 year: 2010 end-page: 144 ident: b5 article-title: Accelerating correlated quantum chemistry calculations using graphical processing units and a mixed precision matrix multiplication library publication-title: J Chem Theory Comput – volume: 33 start-page: 989 year: 2022 end-page: 1001 ident: b29 article-title: Combinatorial BLAS 2.0: Scaling combinatorial algorithms on distributed-memory systems publication-title: IEEE Trans Parallel Distrib Syst – year: 2019 ident: b16 article-title: Approximate multiplication of nearly sparse matrices with decay in a fully recursive distributed task-based parallel framework – year: 2020 ident: b25 article-title: An optimized BLAS library – volume: 8 start-page: 3565 year: 2012 end-page: 3573 ident: b27 article-title: Linear scaling self-consistent field calculations with millions of atoms in the condensed phase publication-title: J Chem Theory Comput – volume: 34 start-page: C170 year: 2012 end-page: C191 ident: b13 article-title: Parallel sparse matrix-matrix multiplication and indexing: Implementation and experiments publication-title: SIAM J Sci Comput – year: 2020 ident: b8 article-title: HPL algorithm – volume: 16 start-page: 1 year: 1990 end-page: 17 ident: b21 article-title: A set of level 3 basic linear algebra subprograms publication-title: ACM Trans Math Software – volume: 38 start-page: C624 year: 2016 end-page: C651 ident: b11 article-title: Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication publication-title: SIAM J Sci Comput – volume: 18 start-page: 24 year: 1984 end-page: 25 ident: b22 article-title: Representing matrices as quadtrees for parallel processors: Extended abstract publication-title: SIGSAM Bull – volume: 11 start-page: 3145 year: 2015 end-page: 3152 ident: b10 article-title: Semiempirical molecular dynamics (SEMD) I: Midpoint-based parallel sparse matrix-matrix multiplication algorithm for matrices with decay publication-title: J Chem Theory Comput – volume: 9 start-page: 255 year: 1997 end-page: 274 ident: b7 article-title: SUMMA: scalable universal matrix multiplication algorithm publication-title: Concurr Pract Ex – volume: 40 start-page: 328 year: 2014 end-page: 343 ident: b15 article-title: Chunks and tasks: a programming model for parallelization of dynamic algorithms publication-title: Parallel Comput – volume: 40 start-page: 47 issue: 5–6 year: 2014 ident: 10.1016/j.softx.2022.101159_b12 article-title: Sparse matrix multiplication: The distributed block-compressed sparse row library publication-title: Parallel Comput doi: 10.1016/j.parco.2014.03.012 – volume: 11 start-page: 3145 issue: 7 year: 2015 ident: 10.1016/j.softx.2022.101159_b10 article-title: Semiempirical molecular dynamics (SEMD) I: Midpoint-based parallel sparse matrix-matrix multiplication algorithm for matrices with decay publication-title: J Chem Theory Comput doi: 10.1021/acs.jctc.5b00382 – start-page: 222 year: 2013 ident: 10.1016/j.softx.2022.101159_b28 article-title: Communication optimal parallel multiplication of sparse random matrices – volume: 438 year: 2021 ident: 10.1016/j.softx.2022.101159_b17 article-title: Sparse approximate matrix-matrix multiplication for density matrix purification with error control publication-title: J Comput Phys doi: 10.1016/j.jcp.2021.110354 – volume: 16 start-page: 1 issue: 1 year: 1990 ident: 10.1016/j.softx.2022.101159_b21 article-title: A set of level 3 basic linear algebra subprograms publication-title: ACM Trans Math Software doi: 10.1145/77626.79170 – volume: 46 start-page: 3 issue: 1 year: 2004 ident: 10.1016/j.softx.2022.101159_b6 article-title: Recursive blocked algorithms and hybrid data structures for dense matrix library software publication-title: SIAM Rev doi: 10.1137/S0036144503428693 – volume: 8 start-page: 3565 issue: 10 year: 2012 ident: 10.1016/j.softx.2022.101159_b27 article-title: Linear scaling self-consistent field calculations with millions of atoms in the condensed phase publication-title: J Chem Theory Comput doi: 10.1021/ct200897x – year: 2020 ident: 10.1016/j.softx.2022.101159_b1 – volume: 133 issue: 11 year: 2010 ident: 10.1016/j.softx.2022.101159_b9 article-title: Linear-scaling density-functional simulations of charged point defects in Al2O3 using hierarchical sparse matrix algebra publication-title: J Chem Phys doi: 10.1063/1.3492379 – volume: 33 start-page: 989 issue: 4 year: 2022 ident: 10.1016/j.softx.2022.101159_b29 article-title: Combinatorial BLAS 2.0: Scaling combinatorial algorithms on distributed-memory systems publication-title: IEEE Trans Parallel Distrib Syst doi: 10.1109/TPDS.2021.3094091 – volume: 40 start-page: 328 year: 2014 ident: 10.1016/j.softx.2022.101159_b15 article-title: Chunks and tasks: a programming model for parallelization of dynamic algorithms publication-title: Parallel Comput doi: 10.1016/j.parco.2013.09.006 – volume: 34 start-page: C170 issue: 4 year: 2012 ident: 10.1016/j.softx.2022.101159_b13 article-title: Parallel sparse matrix-matrix multiplication and indexing: Implementation and experiments publication-title: SIAM J Sci Comput doi: 10.1137/110848244 – volume: 57 start-page: 87 year: 2016 ident: 10.1016/j.softx.2022.101159_b14 article-title: Locality-aware parallel block-sparse matrix-matrix multiplication using the chunks and tasks programming model publication-title: Parallel Comput doi: 10.1016/j.parco.2016.06.005 – year: 2020 ident: 10.1016/j.softx.2022.101159_b8 – year: 2017 ident: 10.1016/j.softx.2022.101159_b24 article-title: Dynamic scheduling for efficient hierarchical sparse matrix operations on the GPU – volume: 28 start-page: 2531 issue: 16 year: 2007 ident: 10.1016/j.softx.2022.101159_b23 article-title: A hierarchic sparse matrix data structure for large-scale Hartree-Fock/Kohn-Sham calculations publication-title: J Comput Chem doi: 10.1002/jcc.20691 – volume: 25 start-page: 496 issue: 4 year: 2011 ident: 10.1016/j.softx.2022.101159_b26 article-title: The combinatorial BLAS: design, implementation, and applications publication-title: Int J High Perform C doi: 10.1177/1094342011403516 – year: 2014 ident: 10.1016/j.softx.2022.101159_b3 – year: 2019 ident: 10.1016/j.softx.2022.101159_b20 – volume: 6 start-page: 135 issue: 1 year: 2010 ident: 10.1016/j.softx.2022.101159_b5 article-title: Accelerating correlated quantum chemistry calculations using graphical processing units and a mixed precision matrix multiplication library publication-title: J Chem Theory Comput doi: 10.1021/ct900543q – volume: 38 start-page: C624 issue: 6 year: 2016 ident: 10.1016/j.softx.2022.101159_b11 article-title: Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication publication-title: SIAM J Sci Comput doi: 10.1137/15M104253X – volume: 89 year: 2019 ident: 10.1016/j.softx.2022.101159_b19 article-title: Parallelization and scalability analysis of inverse factorization using the chunks and tasks programming model publication-title: Parallel Comput doi: 10.1016/j.parco.2019.102548 – year: 2020 ident: 10.1016/j.softx.2022.101159_b25 – volume: 225 start-page: 154 year: 2018 ident: 10.1016/j.softx.2022.101159_b30 article-title: Massively parallel sparse matrix function calculations with NTPoly publication-title: Comput Phys Comm doi: 10.1016/j.cpc.2017.12.010 – volume: 18 start-page: 24 issue: 3 year: 1984 ident: 10.1016/j.softx.2022.101159_b22 article-title: Representing matrices as quadtrees for parallel processors: Extended abstract publication-title: SIGSAM Bull doi: 10.1145/1089389.1089398 – volume: 75 year: 2012 ident: 10.1016/j.softx.2022.101159_b4 article-title: O(N) methods in electronic structure calculations publication-title: Rep Progr Phys doi: 10.1088/0034-4885/75/3/036503 – volume: 41 start-page: 729 year: 2020 ident: 10.1016/j.softx.2022.101159_b18 article-title: Localized inverse factorization publication-title: IMA J Numer Anal doi: 10.1093/imanum/drz075 – volume: 45 issue: 4 year: 2019 ident: 10.1016/j.softx.2022.101159_b2 article-title: Algorithm 1000: SuiteSparse:GraphBLAS: Graph algorithms in the language of sparse linear algebra publication-title: ACM Trans Math Software doi: 10.1145/3322125 – volume: 9 start-page: 255 issue: 4 year: 1997 ident: 10.1016/j.softx.2022.101159_b7 article-title: SUMMA: scalable universal matrix multiplication algorithm publication-title: Concurr Pract Ex doi: 10.1002/(SICI)1096-9128(199704)9:4<255::AID-CPE250>3.0.CO;2-2 – year: 2019 ident: 10.1016/j.softx.2022.101159_b16 |
| SSID | ssj0001528524 |
| Score | 2.2251894 |
| Snippet | We present a C++ header-only parallel sparse matrix library, based on sparse quadtree representation of matrices using the Chunks and Tasks programming model.... |
| SourceID | doaj swepub crossref elsevier |
| SourceType | Open Website Open Access Repository Index Database Publisher |
| StartPage | 101159 |
| SubjectTerms | Block-sparse Chunks and Tasks programming model Parallelization Quadtree Sparse matrices Task-based programming |
| Title | The Chunks and Tasks Matrix Library |
| URI | https://dx.doi.org/10.1016/j.softx.2022.101159 https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-426148 https://doaj.org/article/28648d2b241c4cacbfc785a291406092 |
| Volume | 19 |
| WOSCitedRecordID | wos000879382700003&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 | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ - Directory of Open Access Journals customDbUrl: eissn: 2352-7110 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001528524 issn: 2352-7110 databaseCode: DOA dateStart: 20150101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2352-7110 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001528524 issn: 2352-7110 databaseCode: M~E dateStart: 20150101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8QwEA4iHrz4FtcXBfVm0aZpMjn6xIOKBxVvIZ1kcRWquLviyd_uJGllvejFSymhdMI3Tb5MmfmGsV3gqLStVI7KuVyUtcu1FyJ3INADjYGMhcKX6voaHh70zUSrr5ATluSBE3AHHKQAx2tiGhRose6jgspyTZGBPNRx9z1UeiKYSvXBHKrY0ZbTCSNXRHKd5FBM7hrSHvdB0SHnYaQISqUTtBTV-3-y06SMaKSe8wU2154Zs6M010U25ZslNt_1Y8ja5bnMdsjn2cnjuHkeZrZx2a0d0t1VEOH_yNoChRV2d352e3KRt00QcqTQZ5S72hXSV7oPFC05yQUUvkJel0hHFVf4vkShLCAxTVUr1Q9_chDBSuGDuF5VrrLp5qXxayyjtWs1SKkcoAhtI6EoreOlrQlfj7rH9jsMzGvSujBdEtiTiZCZAJlJkPXYccDp-9EgVB0HyH2mdZ_5y309JjuUTcv5icvpVYPfre8ln_ywfzq4P4r2x2MTgkMB6_8xyw02G0ynNN1NNj16G_stNoPvo8HwbTt-enS9-jz7Avp62iw |
| linkProvider | Directory of Open Access Journals |
| 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%3Ajournal&rft.genre=article&rft.atitle=The+Chunks+and+Tasks+Matrix+Library&rft.jtitle=SoftwareX&rft.au=Rubensson%2C+Emanuel+H.&rft.au=Rudberg%2C+Elias&rft.au=Kruchinina%2C+Anastasia&rft.au=Artemov%2C+Anton+G.&rft.date=2022-07-01&rft.issn=2352-7110&rft.eissn=2352-7110&rft.volume=19&rft_id=info:doi/10.1016%2Fj.softx.2022.101159&rft.externalDocID=oai_DiVA_org_uu_426148 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2352-7110&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2352-7110&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2352-7110&client=summon |