{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:20Z","timestamp":1740099080015,"version":"3.37.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319780238"},{"type":"electronic","value":"9783319780245"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-78024-5_18","type":"book-chapter","created":{"date-parts":[[2018,3,22]],"date-time":"2018-03-22T08:28:25Z","timestamp":1521707305000},"page":"197-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Experiments with Sparse Cholesky Using a Parametrized Task Graph\u00a0Implementation"],"prefix":"10.1007","author":[{"given":"Iain","family":"Duff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florent","family":"Lopez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,23]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-319-58943-5_14","volume-title":"Euro-Par 2016: Parallel Processing Workshops","author":"E Agullo","year":"2017","unstructured":"Agullo, E., Bosilca, G., Buttari, A., Guermouche, A., Lopez, F.: Exploiting a parametrized task graph model for the parallelization of a sparse direct multifrontal solver. In: Desprez, F., Dutot, P.-F., Kaklamanis, C., Marchal, L., Molitorisz, K., Ricci, L., Scarano, V., Vega-Rodr\u00edguez, M.A., Varbanescu, A.L., Hunold, S., Scott, S.L., Lankes, S., Weidendorfer, J. (eds.) Euro-Par 2016. LNCS, vol. 10104, pp. 175\u2013186. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58943-5_14"},{"issue":"4","key":"18_CR2","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1137\/S0895479894278952","volume":"17","author":"PR Amestoy","year":"1996","unstructured":"Amestoy, P.R., Davis, T.A., Duff, I.S.: An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17(4), 886\u2013905 (1996)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"18_CR3","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/cpe.1631","volume":"23","author":"C Augonnet","year":"2011","unstructured":"Augonnet, C., Thibault, S., Namyst, R., Wacrenier, P.-A.: STARPU: a unified platform for task scheduling on heterogeneous multicore architectures. Concurr. Comput. Pract. Exp. 23(2), 187\u2013198 (2011)","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Bosilca, G., Bouteiller, A., Danalis, A., Faverge, M., Haidar, A., H\u00e9rault, T., Kurzak, J., Langou, J., Lemarinier, P., Ltaief, H., Luszczek, P., Yarkhan, A., Dongarra, J.: Distibuted dense numerical linear algebra algorithms on massively parallel architectures: DPLASMA. In: Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing Workshops and Ph.D. Forum (IPDPSW 2011), PDSEC 2011, Anchorage, USA, pp. 1432\u20131441, May 2011","DOI":"10.1109\/IPDPS.2011.299"},{"issue":"6","key":"18_CR5","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/MCSE.2013.98","volume":"15","author":"G Bosilca","year":"2013","unstructured":"Bosilca, G., Bouteiller, A., Danalis, A., Faverge, M., H\u00e9rault, T., Dongarra, J.: PaRSEC: Exploiting heterogeneity to enhance scalability. Comput. Sci. Eng. 15(6), 36\u201345 (2013)","journal-title":"Comput. Sci. Eng."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Cosnard, M., Loi, M.: Automatic task graph generation techniques. In: Proceedings of the Twenty-Eighth Hawaii International Conference on System Sciences 1995, vol. 2, pp. 113\u2013122, January 1995","DOI":"10.1109\/HICSS.1995.375471"},{"issue":"1","key":"18_CR7","first-page":"1:1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The university of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1:1\u20131:25 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"18_CR8","unstructured":"Duff, I.S., Hogg, J., Lopez, F.: Experiments with sparse Cholesky using a sequential task-flow implementation. Technical report RAL-TR-16-016. NLAFET Working Note 7 (2016)"},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1137\/0715069","volume":"15","author":"A George","year":"1978","unstructured":"George, A., Liu, J.W.H.: An automatic nested dissection algorithm for irregular finite element problems. SINUM 15, 1053\u20131069 (1978)","journal-title":"SINUM"},{"issue":"6","key":"18_CR10","doi-asserted-by":"crossref","first-page":"3627","DOI":"10.1137\/090757216","volume":"32","author":"JD Hogg","year":"2010","unstructured":"Hogg, J.D., Reid, J.K., Scott, J.A.: Design of a multicore sparse Cholesky factorization using DAGs. SIAM J. Sci. Comput. 32(6), 3627\u20133649 (2010)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"18_CR11","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"18_CR12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/214392.214398","volume":"11","author":"JWH Liu","year":"1985","unstructured":"Liu, J.W.H.: Modification of the minimum-degree algorithm by multiple elimination. ACM Trans. Math. Softw. 11(2), 141\u2013153 (1985)","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78024-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,13]],"date-time":"2019-10-13T03:54:59Z","timestamp":1570938899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-78024-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319780238","9783319780245"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78024-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}