{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:50:33Z","timestamp":1743148233788,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030293994"},{"type":"electronic","value":"9783030294007"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29400-7_35","type":"book-chapter","created":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T23:02:41Z","timestamp":1566169361000},"page":"495-506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Linear Systems Solvers for Distributed-Memory Machines with GPU Accelerators"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9697-0145","authenticated-orcid":false,"given":"Jakub","family":"Kurzak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2996-1641","authenticated-orcid":false,"given":"Mark","family":"Gates","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9509-7794","authenticated-orcid":false,"given":"Ali","family":"Charara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3901-9695","authenticated-orcid":false,"given":"Asim","family":"YarKhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6196-2508","authenticated-orcid":false,"given":"Ichitaro","family":"Yamazaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3247-1782","authenticated-orcid":false,"given":"Jack","family":"Dongarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"key":"35_CR1","first-page":"287","volume":"2","author":"BS Andersen","year":"2002","unstructured":"Andersen, B.S., Gunnels, J.A., Gustavson, F., Wasniewski, J.: A recursive formulation of the inversion of symmetric positive definite matrices in packed storage data format. PARA 2, 287\u2013296 (2002)","journal-title":"PARA"},{"issue":"2","key":"35_CR2","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/383738.383741","volume":"27","author":"BS Andersen","year":"2001","unstructured":"Andersen, B.S., Wa\u015bniewski, J., Gustavson, F.G.: A recursive formulation of Cholesky factorization of a matrix in packed storage. ACM Trans. Math. Softw. (TOMS) 27(2), 214\u2013244 (2001)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"35_CR3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719642","volume-title":"ScaLAPACK Users\u2019 Guide","author":"LS Blackford","year":"1997","unstructured":"Blackford, L.S., et al.: ScaLAPACK Users\u2019 Guide. SIAM, Philadelphia (1997)"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Castaldo, A., Whaley, C.: Scaling LAPACK panel operations using parallel cache assignment. In: ACM Sigplan Notices, vol. 45, pp. 223\u2013232. ACM (2010)","DOI":"10.1145\/1837853.1693484"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Chan, E., van de Geijn, R., Chapman, A.: Managing the complexity of lookahead for LU factorization with pivoting. In: Proceedings of the Twenty-second Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 200\u2013208. ACM (2010)","DOI":"10.1145\/1810479.1810520"},{"issue":"3","key":"35_CR6","first-page":"173","volume":"5","author":"J Choi","year":"1996","unstructured":"Choi, J., Dongarra, J., Ostrouchov, S., Petitet, A., Walker, D., Whaley, C.: Design and implementation of the ScaLAPACK LU, QR, and Cholesky factorization routines. Sci. Program. 5(3), 173\u2013184 (1996)","journal-title":"Sci. Program."},{"issue":"7","key":"35_CR7","doi-asserted-by":"publisher","first-page":"1408","DOI":"10.1002\/cpe.3110","volume":"26","author":"J Dongarra","year":"2014","unstructured":"Dongarra, J., Faverge, M., Ltaief, H., Luszczek, P.: Achieving numerical accuracy and high performance using recursive tile LU factorization with partial pivoting. Concurr. Comput. Pract. Exp. 26(7), 1408\u20131431 (2014)","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"35_CR8","unstructured":"Gates, M., et al.: SLATE working note 2: C++ API for BLAS and LAPACK. Technical report ICL-UT-17-03, Innovative Computing Laboratory, University of Tennessee, June 2017. Revision 03\u20132018"},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BFb0095337","volume-title":"Applied Parallel Computing Large Scale Scientific and Industrial Problems","author":"F Gustavson","year":"1998","unstructured":"Gustavson, F., Henriksson, A., Jonsson, I., K\u00e5gstr\u00f6m, B., Ling, P.: Recursive blocked data formats and BLAS\u2019s for dense linear algebra algorithms. In: K\u00e5gstr\u00f6m, B., Dongarra, J., Elmroth, E., Wa\u015bniewski, J. (eds.) PARA 1998. LNCS, vol. 1541, pp. 195\u2013206. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0095337"},{"issue":"3","key":"35_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/2168773.2168775","volume":"38","author":"F Gustavson","year":"2012","unstructured":"Gustavson, F., Karlsson, L., K\u00e5gstr\u00f6m, B.: Parallel and cache-efficient in-place matrix storage format conversion. ACM Trans. Math. Softw. (TOMS) 38(3), 17 (2012)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-75755-9_18","volume-title":"Applied Parallel Computing. State of the Art in Scientific Computing","author":"J Kurzak","year":"2007","unstructured":"Kurzak, J., Dongarra, J.: Implementing linear algebra routines on multi-core processors with pipelining and a look ahead. In: K\u00e5gstr\u00f6m, B., Elmroth, E., Dongarra, J., Wa\u015bniewski, J. (eds.) PARA 2006. LNCS, vol. 4699, pp. 147\u2013156. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75755-9_18"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.parco.2018.12.008","volume":"85","author":"K Sala","year":"2019","unstructured":"Sala, K., Teruel, X., Perez, J.M., Pe\u00f1a, A.J., Beltran, V., Labarta, J.: Integrating blocking and non-blocking MPI primitives with task-based programming models. Parallel Comput. 85, 153\u2013166 (2019)","journal-title":"Parallel Comput."},{"issue":"3","key":"35_CR13","first-page":"1","volume":"6","author":"DJ Sorin","year":"2011","unstructured":"Sorin, D.J., Hill, M.D., Wood, D.A.: A primer on memory consistency and cache coherence. Synth. Lect. Comput. Arch. 6(3), 1\u2013212 (2011)","journal-title":"Synth. Lect. Comput. Arch."},{"key":"35_CR14","unstructured":"Strazdins, P., et al.: A comparison of lookahead and algorithmic blocking techniques for parallel matrix factorization (1998)"},{"issue":"1","key":"35_CR15","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2894747","volume":"43","author":"D Sukkari","year":"2016","unstructured":"Sukkari, D., Ltaief, H., Keyes, D.: A high performance QDWH-SVD solver using hardware accelerators. ACM Trans. Math. Softw. (TOMS) 43(1), 6 (2016)","journal-title":"ACM Trans. Math. Softw. (TOMS)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2019: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29400-7_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T00:05:41Z","timestamp":1691885141000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29400-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030293994","9783030294007"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29400-7_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"G\u00f6ttingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/europar.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"142","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,94","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"double blind review in two cases","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}