{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T06:54:28Z","timestamp":1780642468302,"version":"3.54.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0167-8191(01)00135-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:38:00Z","timestamp":1027600680000},"page":"187-197","source":"Crossref","is-referenced-by-count":92,"title":["Two-level dynamic scheduling in PARDISO: Improved scalability on shared memory multiprocessing systems"],"prefix":"10.1016","volume":"28","author":[{"given":"Olaf","family":"Schenk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Klaus","family":"G\u00e4rtner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(01)00135-1_BIB1","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/S0045-7825(99)00242-X","article-title":"Multifrontal parallel distributed symmetric and unsymmetric solvers","volume":"184","author":"Amestoy","year":"2000","journal-title":"Comput. Meth. Appl. Mech. Eng."},{"key":"10.1016\/S0167-8191(01)00135-1_BIB2","doi-asserted-by":"crossref","unstructured":"P.R. Amestoy, I.S. Duff, J.-Y. L'Excellent, X.S. Li, Analysis and comparison of two general sparse solvers for distributed memory computers, Technical Report TR\/PA\/00\/90, CERFACS, Toulouse, France, December 2000, ACM Trans. Math. Software, submitted","DOI":"10.2172\/776597"},{"issue":"1","key":"10.1016\/S0167-8191(01)00135-1_BIB3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1137\/S0895479899358194","article-title":"A fully asynchronous multifrontal solver using distributed dynamic scheduling","volume":"23","author":"Amestoy","year":"2001","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"10.1016\/S0167-8191(01)00135-1_BIB4","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0904032","article-title":"Numerical methods for semiconductor device simulation","volume":"4","author":"Bank","year":"1983","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"10.1016\/S0167-8191(01)00135-1_BIB5","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1090\/S0025-5718-1977-0428694-0","article-title":"Some stable methods for calculating inertia and solving symmetric linear systems","volume":"31","author":"Bunch","year":"1977","journal-title":"Math. Comput."},{"issue":"1","key":"10.1016\/S0167-8191(01)00135-1_BIB6","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1137\/S0895479894246905","article-title":"An unsymmetric-pattern multifrontal method for sparse LU factorization","volume":"18","author":"Davis","year":"1997","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"10.1016\/S0167-8191(01)00135-1_BIB7","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1137\/S0895479897317685","article-title":"An asynchronous parallel supernodal algorithm to sparse partial pivoting","volume":"20","author":"Demmel","year":"1999","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"10.1016\/S0167-8191(01)00135-1_BIB8","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1137\/S0895479895291765","article-title":"A supernodal approach to sparse partial pivoting","volume":"20","author":"Demmel","year":"1999","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/S0167-8191(01)00135-1_BIB9","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1145\/355958.355968","article-title":"Algorithm 575. Permutations for a zero-free diagonal","volume":"7","author":"Duff","year":"1981","journal-title":"ACM Trans. Math. Software"},{"issue":"4","key":"10.1016\/S0167-8191(01)00135-1_BIB10","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1137\/S0895479897317661","article-title":"The design and use of algorithms for permuting large entries to the diagonal of sparse matrices","volume":"20","author":"Duff","year":"1999","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/S0167-8191(01)00135-1_BIB11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0377-0427(89)90368-3","article-title":"Multiprocessing a sparse matrix code on the Alliant FX\/8","volume":"27","author":"Duff","year":"1989","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/S0167-8191(01)00135-1_BIB12","unstructured":"A. Gupta, WSMP: Watson sparse matrix package (Part-II: direct solution of general sparse systems, Technical Report RC 21888 (98472), IBM T. J. Watson Research Center, Yorktown Heights, NY, November 20, 2000"},{"key":"10.1016\/S0167-8191(01)00135-1_BIB13","unstructured":"A.Gupta, Recent advances in direct methods for solving unsymmetric sparse systems of linear equations, Technical Report RC 22039 (98933), IBM T. J. Watson Research Center, Yorktown Heights, NY, April 20, 2001"},{"key":"10.1016\/S0167-8191(01)00135-1_BIB14","unstructured":"A. Gupta, L.Ying, On algorithms for finding maximum matchings in bipartite graphs, Technical Report RC 21576 (97320), IBM T. J. Watson Research Center, Yorktown Heights, NY, October 25, 1999"},{"key":"10.1016\/S0167-8191(01)00135-1_BIB15","unstructured":"X.S. Li, J.W. Demmel, Making sparse Gaussian elimination scalable by static pivoting, in: Proceedings of the Supercomputing '98, November 1998"},{"key":"10.1016\/S0167-8191(01)00135-1_BIB16","unstructured":"X.S. Li, J.W. Demmel, A scalable sparse direct solver using static pivoting, in: Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing, San Antonio, TX, March 22\u201324, 1999"},{"issue":"1","key":"10.1016\/S0167-8191(01)00135-1_BIB17","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0611010","article-title":"The role of elimination trees in sparse factorization","volume":"11","author":"Liu","year":"1990","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"10.1016\/S0167-8191(01)00135-1_BIB18","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0914048","article-title":"A supernodal Cholesky factorization algorithm for shared-memory multiprocessors","volume":"14","author":"Ng","year":"1993","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0167-8191(01)00135-1_BIB19","doi-asserted-by":"crossref","unstructured":"O. Schenk, Scalable parallel sparse LU factorization methods on shared memory multiprocessors, Ph.D. Thesis, ETH Z\u00fcrich, 2000","DOI":"10.1007\/BFb0100583"},{"issue":"1","key":"10.1016\/S0167-8191(01)00135-1_BIB20","first-page":"1","article-title":"PARDISO: A high performance serial and parallel sparse linear solver in semiconductor device simulation","volume":"789","author":"Schenk","year":"2001","journal-title":"Future Generation Comput. Syst."},{"key":"10.1016\/S0167-8191(01)00135-1_BIB21","unstructured":"O. Schenk, K. G\u00e4rtner, Sparse factorization with two-level scheduling in PARDISO, in: Proceedings of the 10th SIAM Conference on Parallel Processing for Scientific Computing, Portsmouth, VA, March 12\u201314, 2001"},{"issue":"1","key":"10.1016\/S0167-8191(01)00135-1_BIB22","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1023\/A:1022326604210","article-title":"Efficient sparse LU factorization with left\u2013right looking strategy on shared memory multiprocessors","volume":"40","author":"Schenk","year":"2000","journal-title":"BIT"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819101001351?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819101001351?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T12:15:50Z","timestamp":1578485750000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819101001351"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0167819101001351"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(01)00135-1","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}