{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:03:34Z","timestamp":1768028614486,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642328190","type":"print"},{"value":"9783642328206","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32820-6_55","type":"book-chapter","created":{"date-parts":[[2012,8,23]],"date-time":"2012-08-23T12:26:25Z","timestamp":1345724785000},"page":"551-562","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Avoiding Communication through a Multilevel LU Factorization"],"prefix":"10.1007","author":[{"given":"Simplice","family":"Donfack","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laura","family":"Grigori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amal","family":"Khabou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"55_CR1","doi-asserted-by":"crossref","unstructured":"Agullo, E., Coti, C., Dongarra, J., Herault, T., Langem, J.: QR factorization of tall and skinny matrices in a grid computing environment. In: Parallel Distributed Processing Symposium (IPDPS), pp. 1\u201311. IEEE (2010)","DOI":"10.1109\/IPDPS.2010.5470475"},{"key":"55_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719604","volume-title":"LAPACK Users\u2019 Guide","author":"E. Anderson","year":"1999","unstructured":"Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users\u2019 Guide. SIAM, Philadelphia (1999)"},{"key":"55_CR3","doi-asserted-by":"crossref","unstructured":"Blackford, L.S., Choi, J., Cleary, A., D\u2019Azevedo, E., Demmel, J., Dhillon, I., Dongarra, J., Hammarling, S., Henry, G., Petitet, A., Stanley, K., Walker, D., Whaley, R.C.: Scalapack: A linear algebra library for message-passing computers. In: SIAM Conference on Parallel Processing (1997)","DOI":"10.1145\/369028.369038"},{"key":"55_CR4","unstructured":"Cannon, L.E.: A cellular computer to implement the Kalman filter algorithm. PhD thesis, Montana State University (1969)"},{"issue":"4","key":"55_CR5","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1177\/1094342006070078","volume":"20","author":"F. Cappello","year":"2006","unstructured":"Cappello, F., Desprez, F., Dayde, M., Jeannot, E., Jegou, Y., Lanteri, S., Melab, N., Namyst, R., Primet, P.V.B., Richard, O., et al.: Grid5000: a nation wide experimental grid testbed. International Journal on High Performance Computing Applications\u00a020(4), 481\u2013494 (2006)","journal-title":"International Journal on High Performance Computing Applications"},{"key":"55_CR6","unstructured":"Demmel, J., Grigori, L., Hoemmen, M., Langou, J.: Communication-optimal parallel and sequential QR and LU factorizations. Technical Report UCB\/EECS-2008-89, University of California Berkeley, EECS Department, LAWN #204 (2008)"},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"Donfack, S., Grigori, L., Gupta, A.K.: Adapting communication-avoiding LU and QR factorizations to multicore architectures. In: IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE (2010)","DOI":"10.1109\/IPDPS.2010.5470348"},{"key":"55_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/BFb0095328","volume-title":"Applied Parallel Computing. Large Scale Scientific and Industrial Problems","author":"E. Elmroth","year":"1998","unstructured":"Elmroth, E., Gustavson, F.: New Serial and Parallel Recursive QR Factorization Algorithms for SMP Systems. In: K\u00e5gstr\u00f6m, B., Elmroth, E., Wa\u015bniewski, J., Dongarra, J. (eds.) PARA 1998. LNCS, vol.\u00a01541, pp. 120\u2013128. Springer, Heidelberg (1998)"},{"key":"55_CR9","doi-asserted-by":"crossref","unstructured":"Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: 40th Annual Symposium on Foundations of Computer Science, pp. 285\u2013297 (1999)","DOI":"10.1109\/SFFCS.1999.814600"},{"issue":"4","key":"55_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/(SICI)1096-9128(199704)9:4<255::AID-CPE250>3.0.CO;2-2","volume":"9","author":"R.A. Geijn Van De","year":"1997","unstructured":"Van De Geijn, R.A., Watts, J.: SUMMA: Scalable Universal Matrix Multiplication Algorithm. Concurrency Practice and Experience\u00a09(4), 255\u2013274 (1997)","journal-title":"Concurrency Practice and Experience"},{"key":"55_CR11","unstructured":"Graham, S.L., Snir, M., Patterson, C.A.: Getting up to speed: The future of supercomputing. National Academies Press (2005)"},{"key":"55_CR12","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1137\/100788926","volume":"32","author":"L. Grigori","year":"2011","unstructured":"Grigori, L., Demmel, J., Xiang, H.: CALU: A communication optimal LU factorization algorithm. SIAM Journal on Matrix Analysis and Applications\u00a032, 1317\u20131350 (2011)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"55_CR13","doi-asserted-by":"crossref","unstructured":"Grigori, L., Demmel, J.W., Xiang, H.: Communication avoiding Gaussian elimination. In: Proceedings of the 2008 ACM\/IEEE Conference on Supercomputing, p. 29. IEEE Press (2008)","DOI":"10.1109\/SC.2008.5214287"},{"key":"55_CR14","unstructured":"Hong, J.-W., Kung, H.T.: I\/O complexity: The red-blue pebble game. In: Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing. ACM (1981)"},{"issue":"9","key":"55_CR15","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1016\/j.jpdc.2004.03.021","volume":"64","author":"D. Irony","year":"2004","unstructured":"Irony, D., Toledo, S., Tiskin, A.: Communication lower bounds for distributed-memory matrix multiplication. Journal of Parallel and Distributed Computing\u00a064(9), 1017\u20131026 (2004)","journal-title":"Journal of Parallel and Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2012 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32820-6_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T04:20:19Z","timestamp":1743999619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32820-6_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642328190","9783642328206"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32820-6_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}