{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:13:38Z","timestamp":1759133618896,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664437"},{"type":"electronic","value":"9783540483113"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","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":[[1999]]},"DOI":"10.1007\/3-540-48311-x_148","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:16:48Z","timestamp":1269897408000},"page":"1059-1067","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A Mapping and Scheduling Algorithm for Parallel Sparse Fan-In Numerical Factorization\u22c6"],"prefix":"10.1007","author":[{"given":"Pascal","family":"H\u00e9non","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Ramet","sequence":"additional","affiliation":[]},{"given":"Jean","family":"Roman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,8,6]]},"reference":[{"key":"148_CR1","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1137\/S0895479894278952","volume":"17","author":"P. Amestoy","year":"1996","unstructured":"P. Amestoy, T. Davis, and I. Duff. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. and Appl., 17:886\u2013905, 1996.","journal-title":"SIAM J. Matrix Anal. and Appl."},{"key":"148_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-1-4613-8369-7_8","volume":"56","author":"C. Ashcraft","year":"1993","unstructured":"C. Ashcraft. The fan-both family of column-based distributed Cholesky factorization algorithms. Graph Theory and Sparse Matrix Computation, IMA, Springer-Verlag, 56:159\u2013190, 1993.","journal-title":"Graph Theory and Sparse Matrix Computation"},{"issue":"3","key":"148_CR3","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1137\/0911033","volume":"11","author":"C. Ashcraft","year":"1990","unstructured":"C. Ashcraft, S.C. Eisenstat, and J. W.-H. Liu. A fan-in algorithm for distributed sparse numerical factorization. SIAM J. Sci. Stat. Comput., 11(3):593\u2013599, 1990.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"148_CR4","doi-asserted-by":"crossref","unstructured":"C. Ashcraft, S.C. Eisenstat, J. W.-H. Liu, and A. Sherman. A comparison of three column based distributed sparse factorization schemes. In Proc. Fifth SIAM Conf. on Parallel Processing for Scientific Computing, 1991.","DOI":"10.21236\/ADA228143"},{"key":"148_CR5","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF01396049","volume":"55","author":"P. Charrier","year":"1989","unstructured":"P. Charrier and J. Roman. FrAlgorithmique et calculs de complexit\u00e9 pour un solveur de type dissections embo\u00eet\u00e9es. Numerische Mathematik, 55:463\u2013476, 1989.","journal-title":"Numerische Mathematik"},{"key":"148_CR6","unstructured":"I.S. Duff. Sparse numerical linear algebra: direct methods and preconditioning. Technical Report TR\/PA\/96\/22, CERFACS, 1996."},{"issue":"4","key":"148_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01407861","volume":"18","author":"G.A. Geist","year":"1989","unstructured":"G.A. Geist and E. Ng. Task scheduling for parallel sparse Cholesky factorization. Internat. J. Parallel Programming, 18(4):291\u2013314, 1989.","journal-title":"Internat. J. Parallel Programming"},{"key":"148_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1007\/BFb0031609","volume-title":"Proceedings of HPCN\u201997","author":"F. Pellegrini","year":"1997","unstructured":"F. Pellegrini and J. Roman. Sparse matrix ordering with scotch. In Proceedings of HPCN\u201997, itVienna, LNCS 1225, pages 370\u2013378, April 1997."},{"key":"148_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of IRREGULAR\u201999","author":"F. Pellegrini","year":"1999","unstructured":"F. Pellegrini and J. Roman. Sparse matrix ordering with scotch. InProceedings of HPCN\u201997, Vienna, LNCS 1225, pages 370\u2013378, April 1997."},{"issue":"5","key":"148_CR10","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0914074","volume":"14","author":"A. Pothen","year":"1993","unstructured":"A. Pothen and C. Sun. A mapping algorithm for parallel sparse Cholesky factorization. SIAM J. Sci. Comput., 14(5):1253\u20131257, September 1993.","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"148_CR11","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1137\/S106482759426715X","volume":"17","author":"E. Rothberg","year":"1996","unstructured":"E. Rothberg. Performance of panel and block approaches to sparse Cholesky factorization on the iPSC\/860 and Paragon multicomputers. SIAM J. Sci. Comput., 17(3):699\u2013713, May 1996.","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"148_CR12","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1137\/0915085","volume":"15","author":"E. Rothberg","year":"1994","unstructured":"E. Rothberg and A. Gupta. An efficient block-oriented approach to parallel sparse Cholesky factorization. SIAM J. Sci. Comput., 15(6):1413\u20131439, November 1994.","journal-title":"SIAM J. Sci. Comput."},{"key":"148_CR13","doi-asserted-by":"crossref","unstructured":"E. Rothberg and R. Schreiber. Improved load distribution in parallel sparse Cholesky factorization. In Proceedings of Supercomputing\u201994, pages 783\u2013792. IEEE, 1994.","DOI":"10.1145\/602770.602897"}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201999 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48311-X_148","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T14:44:26Z","timestamp":1600353866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48311-X_148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664437","9783540483113"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48311-x_148","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"6 August 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}