{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:08:50Z","timestamp":1768028930725,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540674429","type":"print"},{"value":"9783540455912","type":"electronic"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[[2000]]},"DOI":"10.1007\/3-540-45591-4_70","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T05:18:03Z","timestamp":1195017483000},"page":"519-525","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["PaStiX: A Parallel Sparse Direct Solver Based on a Static Scheduling for Mixed 1D\/2D Block Distributions"],"prefix":"10.1007","author":[{"given":"Pascal","family":"H\u00e9non","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Ramet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Roman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,5,25]]},"reference":[{"key":"70_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":"70_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":"70_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":"70_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":"70_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. Algorithmique 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":"70_CR6","unstructured":"I. S. Duff. Sparse numerical linear algebra: direct methods and preconditioning. Technical Report TR\/PA\/96\/22, CERFACS, 1996."},{"issue":"4","key":"70_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":"70_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1007\/3-540-48311-X_148","volume-title":"EuroPAR\u201999","author":"P. H\u00e9non","year":"1999","unstructured":"P. H\u00e9non, P. Ramet, and J. Roman. A Mapping and Scheduling Algorithm for Parallel Sparse Fan-In Numerical Factorization. In EuroPAR\u201999, LNCS 1685, pages 1059\u20131067. Springer Verlag, 1999."},{"key":"70_CR9","unstructured":"M. Joshi, G. Karypis, V. Kumar, A. Gupta, and Gustavson F. PSPASES: Scalable Parallel Direct Solver Library for Sparse Symmetric Positive Definite Linear Systems. Technical report, University of Minnesota and IBM Thomas J. Watson Research Center, May 1999."},{"key":"70_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"986","DOI":"10.1007\/BFb0097983","volume-title":"Proceedings of IRREGULAR\u201999, Puerto Rico","author":"F. Pellegrini","year":"1999","unstructured":"F. Pellegrini, J. Roman, and P. Amestoy. Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering. In Proceedings of IRREGULAR\u201999, Puerto Rico, LNCS 1586, pages 986\u2013995, April 1999. Extended version to be published in Concurrency: Practice and Experience."},{"issue":"5","key":"70_CR11","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":"70_CR12","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":"70_CR13","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":"70_CR14","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","Parallel and Distributed Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45591-4_70","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T05:19:44Z","timestamp":1586150384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45591-4_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540674429","9783540455912"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45591-4_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"25 May 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}