{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:32:41Z","timestamp":1725593561275},"reference-count":45,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1109\/cluster.2019.8891024","type":"proceedings-article","created":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T18:00:53Z","timestamp":1573668053000},"page":"1-12","source":"Crossref","is-referenced-by-count":0,"title":["Leveraging Task-Based Polar Decomposition Using PARSEC on Massively Parallel Systems"],"prefix":"10.1109","author":[{"given":"Dalal","family":"Sukkari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hatem","family":"Ltaief","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Keyes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Faverge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/978-3-642-23397-5_10","article-title":"Communication-optimal parallel 2.5d matrix multiplication and lu factorization algorithms","author":"solomonik","year":"2011","journal-title":"Euro-Par 2011 Parallel Processing"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.46"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1527286.1527288"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1301"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2008.10.002"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.05.001"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.48"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063393"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470443"},{"key":"ref34","article-title":"Communication-avoiding parallel and sequential QR and LU factorizations: theory and practice","author":"demmel","year":"2008","journal-title":"Technical Report LAPACK Working Note"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248397"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.80"},{"journal-title":"The Chameleon Project","year":"2018","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2013.01.003"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1096-9128(199704)9:4<255::AID-CPE250>3.0.CO;2-2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.299"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503250"},{"journal-title":"The HiCMA Library","year":"2018","key":"ref16"},{"key":"ref17","first-page":"22","article-title":"Tile Low Rank Cholesky Factorization for Climate\/Weather Modeling Applications on Manycore Architectures","author":"akbudak","year":"2017","journal-title":"High Performance Computing 32nd International Conference ISC High Performance 2017"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1007\/978-3-319-96983-1_51","article-title":"Exploiting data sparsity for large-scale matrix computations","author":"akbudak","year":"2018","journal-title":"Euro-Par 2018 Parallel Processing"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1631"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.2307\/2324422"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2755655"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.1975.308025"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/120876605"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2011.10.003"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/090774999"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/WOLFHPC.2014.8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719642"},{"journal-title":"Matrix Computations","year":"1996","author":"golub","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/180\/1\/012037"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/0907079"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2894747"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3328723"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719604"},{"journal-title":"Matrix Algebra on Gpu and Multicore Architectures","year":"2009","key":"ref21"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/71.642949"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-43659-3_44"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/BF01396242"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2427023.2427030"},{"key":"ref44","article-title":"Installation guide for LAPACK","author":"blackford","year":"1999","journal-title":"Technical Report LAPACK Working Note"},{"journal-title":"Libsci","year":"0","key":"ref26"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2833179.2833186"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3309548"}],"event":{"name":"2019 IEEE International Conference on Cluster Computing (CLUSTER)","start":{"date-parts":[[2019,9,23]]},"location":"Albuquerque, NM, USA","end":{"date-parts":[[2019,9,26]]}},"container-title":["2019 IEEE International Conference on Cluster Computing (CLUSTER)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8884608\/8890988\/08891024.pdf?arnumber=8891024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T21:55:12Z","timestamp":1658094912000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8891024\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/cluster.2019.8891024","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}