{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T21:40:07Z","timestamp":1767994807433,"version":"3.49.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031299261","type":"print"},{"value":"9783031299278","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-29927-8_28","type":"book-chapter","created":{"date-parts":[[2023,4,7]],"date-time":"2023-04-07T12:02:50Z","timestamp":1680868970000},"page":"359-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["QR Factorization of\u00a0Block Low-Rank Matrices on\u00a0Multi-instance GPU"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Ohshima","sequence":"first","affiliation":[]},{"given":"Akihiro","family":"Ida","sequence":"additional","affiliation":[]},{"given":"Rio","family":"Yokota","sequence":"additional","affiliation":[]},{"given":"Ichitaro","family":"Yamazaki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,8]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s006070050015","volume":"62","author":"W Hackbusch","year":"1999","unstructured":"Hackbusch, W.: A sparse matrix arithmetic based on H-matrices. Part I: introduction to H-matrices. Computing 62, 89\u2013108 (1999). https:\/\/doi.org\/10.1007\/s006070050015","journal-title":"Computing"},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"A1451","DOI":"10.1137\/120903476","volume":"37","author":"P Amestoy","year":"2015","unstructured":"Amestoy, P., Ashcraft, C., Boiteau, O., Buttari, A., L\u2019Excellent, J.-Y., Weisbecker, C.: Improving multifrontal methods by means of block low-rank representations. SIAM J. Sci. Comput. 37(3), A1451\u2013A1474 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"831","DOI":"10.2197\/ipsjjip.27.831","volume":"27","author":"A Ida","year":"2019","unstructured":"Ida, A., Nakashima, H., Hiraishi, T., Yamazaki, I., Yokota, R., Iwashita, T.: QR factorization of block low-rank matrices with weak admissibility condition. J. Inf. Process. 27, 831\u2013839 (2019). https:\/\/doi.org\/10.2197\/ipsjjip.27.831","journal-title":"J. Inf. Process."},{"key":"28_CR4","doi-asserted-by":"publisher","DOI":"10.1145\/3538647","author":"MR Apriansyah","year":"2022","unstructured":"Apriansyah, M.R., Yokota, R.: Parallel QR factorization of block low-rank matrices. ACM Trans. Math. Softw. (2022). https:\/\/doi.org\/10.1145\/3538647","journal-title":"ACM Trans. Math. Softw."},{"issue":"3\u20134","key":"28_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00607-010-0087-y","volume":"88","author":"P Benner","year":"2010","unstructured":"Benner, P., Mach, T.: On the QR decomposition of H-matrices. Computing 88(3\u20134), 111\u2013129 (2010). https:\/\/doi.org\/10.1007\/s00607-010-0087-y","journal-title":"Computing"},{"key":"28_CR6","doi-asserted-by":"publisher","unstructured":"Ohshima, S., Yamazaki, I., Ida, A., Yokota, R.: Optimization of numerous small dense-matrix-vector multiplications in H-matrix arithmetic on GPU. In: 2019 IEEE 13th International Symposium on Embedded Multicore\/Many-core Systems-on-Chip (MCSoC), pp. 9\u201316 (2019). https:\/\/doi.org\/10.1109\/MCSoC.2019.00009","DOI":"10.1109\/MCSoC.2019.00009"},{"key":"28_CR7","doi-asserted-by":"publisher","unstructured":"Gandham, R., Zhang, Y., Esler, K., Natoli, V.: Improving GPU throughput of reservoir simulations using NVIDIA MPS and MIG. In: Fifth EAGE Workshop on High Performance Computing for Upstream, vol. 2021, pp. 1\u20135 (2021). https:\/\/doi.org\/10.3997\/2214-4609.2021612025","DOI":"10.3997\/2214-4609.2021612025"},{"key":"28_CR8","doi-asserted-by":"publisher","unstructured":"Agrawal, N., Das, A., Pathak, R., Dorlikar, P., Modani, M.: Molecular dynamics simulations accelerate on elastic multi-GPU architecture build with FP64\/TF32 latest streaming multiprocessor ampere architecture. In: Kaiser, M.S., Xie, J., Rathore, V.S. (eds.) Information and Communication Technology for Competitive Strategies (ICTCS 2021). LNNS, vol. 401, pp. 109\u2013120. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-19-0098-3_12","DOI":"10.1007\/978-981-19-0098-3_12"},{"key":"28_CR9","unstructured":"Batched BLAS: https:\/\/icl.utk.edu\/bblas\/. Accessed 19 Aug 2022"},{"key":"28_CR10","unstructured":"BLAS-like Extensions: https:\/\/www.intel.com\/content\/www\/us\/en\/develop\/documentation\/onemkl-developer-reference-c\/top\/blas-and-sparse-blas-routines\/blas-like-extensions.html. Accessed 19 Aug 2022"},{"issue":"5\u20136","key":"28_CR11","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.parco.2009.12.005","volume":"36","author":"S Tomov","year":"2010","unstructured":"Tomov, S., Dongarra, J., Baboulin, M.: Towards dense linear algebra for hybrid GPU accelerated manycore systems. Parallel Comput. 36(5\u20136), 232\u2013240 (2010). https:\/\/doi.org\/10.1016\/j.parco.2009.12.005","journal-title":"Parallel Comput."},{"issue":"5","key":"28_CR12","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1137\/0912056","volume":"12","author":"W Jalby","year":"1991","unstructured":"Jalby, W., Philippe, B.: Stability analysis and improvement of the block Gram-Schmidt algorithm. SIAM J. Sci. Stat. Comput. 12(5), 1058\u20131073 (1991)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"538","DOI":"10.2197\/ipsjjip.30.538","volume":"30","author":"A Ida","year":"2022","unstructured":"Ida, A.: Solving block low-rank matrix eigenvalue problems. J. Inf. Process. 30, 538\u2013551 (2022). https:\/\/doi.org\/10.2197\/ipsjjip.30.538","journal-title":"J. Inf. Process."}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing, Applications and Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-29927-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,7]],"date-time":"2023-04-07T12:07:35Z","timestamp":1680869255000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-29927-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031299261","9783031299278"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-29927-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PDCAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel and Distributed Computing: Applications and Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sendai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pdcat2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.hpc.is.tohoku.ac.jp\/pdcat2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"95","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":"24","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":"16","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","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":"5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}