{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:34:10Z","timestamp":1743032050122,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031506833"},{"type":"electronic","value":"9783031506840"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-50684-0_24","type":"book-chapter","created":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T10:02:09Z","timestamp":1713175329000},"page":"306-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tall-and-Skinny QR Factorization for\u00a0Clusters of\u00a0GPUs Using High-Performance Building Blocks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3969-2174","authenticated-orcid":false,"given":"Andr\u00e9s E.","family":"Tom\u00e1s","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5454-165X","authenticated-orcid":false,"given":"Enrique S.","family":"Quintana-Ort\u00ed","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,16]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Agullo, E., et al.: Numerical linear algebra on emerging architectures: The PLASMA and MAGMA projects, vol. 180 (2009)","key":"24_CR1","DOI":"10.1088\/1742-6596\/180\/1\/012037"},{"doi-asserted-by":"publisher","unstructured":"Anderson, M., Ballard, G., Demmel, J., Keutzer, K.: Communication-avoiding QR decomposition for GPUs. In: 2011 IEEE International Parallel & Distributed Processing Symposium, pp. 48\u201358 (2011). https:\/\/doi.org\/10.1109\/IPDPS.2011.15","key":"24_CR2","DOI":"10.1109\/IPDPS.2011.15"},{"issue":"3","key":"24_CR3","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00211-012-0496-2","volume":"123","author":"J Barlow","year":"2013","unstructured":"Barlow, J., Smoktunowicz, A.: Reorthogonalized block classical gram-Schmidt. Numer. Math. 123(3), 395\u2013423 (2013)","journal-title":"Numer. Math."},{"doi-asserted-by":"crossref","unstructured":"Bj\u00f6rck, A.: Numerical Methods for Least Squares Problems. SIAM (1996)","key":"24_CR4","DOI":"10.1137\/1.9781611971484"},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.parco.2008.10.002","volume":"35","author":"A Buttari","year":"2009","unstructured":"Buttari, A., Langou, J., Kurzak, J., Dongarra, J.: A class of parallel tiled linear algebra algorithms for multicore architectures. Parallel Comput. 35(1), 38\u201353 (2009). https:\/\/doi.org\/10.1016\/j.parco.2008.10.002","journal-title":"Parallel Comput."},{"doi-asserted-by":"crossref","unstructured":"Carson, E., Lund, K., Rozlo\u017en\u00edk, M., Thomas, S.: Block gram-schmidt algorithms and their stability properties. Linear Algebra Appl. 638, 150\u2013195 (2022). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0024379521004523","key":"24_CR6","DOI":"10.1016\/j.laa.2021.12.017"},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"A206","DOI":"10.1137\/080731992","volume":"34","author":"J Demmel","year":"2012","unstructured":"Demmel, J., Grigori, L., Hoemmen, M., Langou, J.: Communication-optimal parallel and sequential QR and LU factorizations. SIAM J. Sci. Comput. 34(1), A206\u2013A239 (2012). https:\/\/doi.org\/10.1137\/080731992","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"24_CR8","doi-asserted-by":"publisher","first-page":"A477","DOI":"10.1137\/18M1218212","volume":"42","author":"T Fukaya","year":"2020","unstructured":"Fukaya, T., Kannan, R., Nakatsukasa, Y., Yamamoto, Y., Yanagisawa, Y.: Shifted Cholesky QR for computing the QR factorization of ill-conditioned matrices. SIAM J. Sci. Comput. 42(1), A477\u2013A503 (2020). https:\/\/doi.org\/10.1137\/18M1218212","journal-title":"SIAM J. Sci. Comput."},{"key":"24_CR9","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Loan, C.F.V.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"doi-asserted-by":"crossref","unstructured":"Gunter, B.C., van de Geijn, R.A.: Parallel out-of-core computation and updating the QR factorization. ACM Trans. Math. Soft. 31(1), 60\u201378 (2005). http:\/\/doi.acm.org\/10.1145\/1055531.1055534","key":"24_CR10","DOI":"10.1145\/1055531.1055534"},{"doi-asserted-by":"crossref","unstructured":"Leon, S.J., Bj\u00f6rck, \u00c5., Gander, W.: Gram-Schmidt orthogonalization: 100 years and more. Numer. Linear Algebra Appl. 20(3), 492\u2013532 (2013). https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/nla.1839","key":"24_CR11","DOI":"10.1002\/nla.1839"},{"issue":"3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1527286.1527288","volume":"36","author":"G Quintana-Ort\u00ed","year":"2009","unstructured":"Quintana-Ort\u00ed, G., Quintana-Ort\u00ed, E.S., van de Geijn, R.A., Zee, F.G.V., Chan, E.: Programming matrix algorithms-by-blocks for thread-level parallelism. ACM Trans. Math. Softw. 36(3), 1\u201326 (2009). https:\/\/doi.org\/10.1145\/1527286.1527288","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1137\/0910005","volume":"10","author":"R Schreiber","year":"1989","unstructured":"Schreiber, R., Van Loan, C.: A storage-efficient WY representation for products of Householder transformations. SIAM J. Sci. Stat. Comput. 10(1), 53\u201357 (1989). https:\/\/doi.org\/10.1137\/0910005","journal-title":"SIAM J. Sci. Stat. Comput."},{"unstructured":"Snir, M., Otto, S.W., Huss-Lederman, S., Walker, D.W., Dongarra, J.: MPI: The Complete Reference. The MIT Press, Cambridge (1996)","key":"24_CR14"},{"unstructured":"Strazdins, P.: A comparison of lookahead and algorithmic blocking techniques for parallel matrix factorization. Technical report. TR-CS-98-07, Department of Computer Science, The Australian National University, Canberra 0200 ACT, Australia (1998)","key":"24_CR15"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2023: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-50684-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T17:04:31Z","timestamp":1715101471000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50684-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031506833","9783031506840"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50684-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 April 2024","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":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.euro-par.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":"164","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":"49","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":"30% - 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.98","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","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)"}}]}}