{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T08:52:58Z","timestamp":1785833578396,"version":"3.56.0"},"reference-count":18,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T00:00:00Z","timestamp":1672704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:p>Modern GPUs equipped with mixed precision tensor core units present great potential to accelerate dense linear algebra operations such as LU factorization. However, state-of-the-art mixed half\/single precision LU factorization algorithms all require the matrix to be stored in single precision, leading to expensive data movement and storage costs. This is explained by the fact that simply switching the storage precision from single to half leads to significant loss of accuracy, forfeiting all accuracy benefits from using tensor core technology. In this article, we propose a new factorization algorithm that is able to store the matrix in half precision without incurring any significant loss of accuracy. Our approach is based on a left-looking scheme employing single precision buffers of controlled size and a mixed precision doubly partitioned algorithm exploiting tensor cores in the panel factorizations. Our numerical results show that compared with the state of the art, the proposed approach is of similar accuracy but with only half the data movement and memory footprint, and hence potentially much faster: it achieves up to 2\u00d7 and 3.5\u00d7 speedups on V100 and A100 GPUs, respectively.<\/jats:p>","DOI":"10.1177\/10943420221136848","type":"journal-article","created":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T05:58:51Z","timestamp":1672725531000},"page":"165-179","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":7,"title":["Mixed precision LU factorization on GPU tensor cores: reducing data movement and memory footprint"],"prefix":"10.1177","volume":"37","author":[{"given":"Florent","family":"Lopez","sequence":"first","affiliation":[{"name":"Livermore Software Technology, an ANSYS Company, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9949-4634","authenticated-orcid":false,"given":"Theo","family":"Mary","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9, CNRS, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2023,1,3]]},"reference":[{"key":"bibr1-10943420221136848","volume-title":"LAPACK Users\u2019 Guide","author":"Anderson E","year":"1995","edition":"3"},{"key":"bibr2-10943420221136848","unstructured":"Appleyard J, Yokim S (2017) Programming tensor cores in CUDA 9. Available at: https:\/\/devblogs.nvidia.com\/programming-tensor-cores-cuda-9\/ (accessed 25 March 2019)."},{"key":"bibr3-10943420221136848","doi-asserted-by":"publisher","DOI":"10.1137\/19M1289546"},{"key":"bibr4-10943420221136848","doi-asserted-by":"publisher","DOI":"10.1137\/17M1122918"},{"key":"bibr5-10943420221136848","doi-asserted-by":"publisher","DOI":"10.1137\/17M1140819"},{"key":"bibr6-10943420221136848","doi-asserted-by":"publisher","DOI":"10.1137\/20m1334796"},{"key":"bibr7-10943420221136848","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"bibr8-10943420221136848","doi-asserted-by":"publisher","DOI":"10.1137\/20m1357238"},{"key":"bibr9-10943420221136848","doi-asserted-by":"publisher","DOI":"10.1147\/rd.416.0737"},{"key":"bibr10-10943420221136848","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2020.0110"},{"key":"bibr11-10943420221136848","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00050"},{"key":"bibr12-10943420221136848","doi-asserted-by":"publisher","DOI":"10.1137\/18M1226312"},{"key":"bibr13-10943420221136848","doi-asserted-by":"publisher","DOI":"10.1137\/20M1314355"},{"key":"bibr14-10943420221136848","doi-asserted-by":"publisher","DOI":"10.1137\/18M1229511"},{"key":"bibr15-10943420221136848","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027"},{"key":"bibr16-10943420221136848","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386090"},{"key":"bibr17-10943420221136848","doi-asserted-by":"publisher","DOI":"10.1137\/19M1296367"},{"key":"bibr18-10943420221136848","doi-asserted-by":"publisher","DOI":"10.1145\/3369583.3392685"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420221136848","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/10943420221136848","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420221136848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:17:25Z","timestamp":1777450645000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/10943420221136848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,3]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["10.1177\/10943420221136848"],"URL":"https:\/\/doi.org\/10.1177\/10943420221136848","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,3]]}}}