{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T04:03:22Z","timestamp":1771473802913,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":[[2003,9]]},"DOI":"10.1016\/s0167-8191(03)00099-1","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T05:16:13Z","timestamp":1063343773000},"page":"1191-1218","source":"Crossref","is-referenced-by-count":23,"title":["Impact of reordering on the memory of a multifrontal solver"],"prefix":"10.1016","volume":"29","author":[{"given":"Abdou","family":"Guermouche","sequence":"first","affiliation":[]},{"given":"Jean-Yves","family":"L\u2019Excellent","sequence":"additional","affiliation":[]},{"given":"Gil","family":"Utard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(03)00099-1_BIB1","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1137\/S0895479894278952","article-title":"An approximate minimum degree ordering algorithm","volume":"17","author":"Amestoy","year":"1996","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"10.1016\/S0167-8191(03)00099-1_BIB2","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1177\/109434209300700105","article-title":"Memory management issues in sparse multifrontal methods on multiprocessors","volume":"7","author":"Amestoy","year":"1993","journal-title":"International Journal of Supercomputer Applications"},{"issue":"1","key":"10.1016\/S0167-8191(03)00099-1_BIB3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1137\/S0895479899358194","article-title":"A fully synchronous multifrontal solver using distributed dynamic scheduling","volume":"23","author":"Amestoy","year":"2001","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"10.1016\/S0167-8191(03)00099-1_BIB4","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":"Computer Methods in Applied Mechanics and Engineering"},{"issue":"4","key":"10.1016\/S0167-8191(03)00099-1_BIB5","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1177\/109434208700100403","article-title":"Progress in sparse matrix methods for large linear systems on vector computers","volume":"1","author":"Ashcraft","year":"1987","journal-title":"International Journal of Supercomputer Applications"},{"key":"10.1016\/S0167-8191(03)00099-1_BIB6","doi-asserted-by":"crossref","unstructured":"J. Choi, J. Demmel, I. Dhillon, J. Dongarra, S. Ostrouchov, A. Petitet, K. Stanley, D. Walker, R.C. Whaley, ScaLAPACK: A portable linear algebra library for distributed memory computers\u2013\u2013design issues and performance, Technical Report LAPACK Working Note 95, CS-95-283, University of Tennessee, 1995","DOI":"10.1007\/3-540-60902-4_12"},{"key":"10.1016\/S0167-8191(03)00099-1_BIB7","unstructured":"I.S. Duff, R.G. Grimes, J.G. Lewis, The Rutherford\u2013Boeing sparse matrix collection, Technical Report TR\/PA\/97\/36, CERFACS, Toulouse, France, 1997. Also Technical Report RAL-TR-97-031 from Rutherford Appleton Laboratory and Technical Report ISSTECH-97-017 from Boeing Information & Support Services"},{"issue":"4","key":"10.1016\/S0167-8191(03)00099-1_BIB8","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/S0895479899358443","article-title":"On algorithms for permuting large entries to the diagonal of a sparse matrix","volume":"22","author":"Duff","year":"2001","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"10.1016\/S0167-8191(03)00099-1_BIB9","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/356044.356047","article-title":"The multifrontal solution of indefinite sparse symmetric linear systems","volume":"9","author":"Duff","year":"1983","journal-title":"ACM Transactions on Mathematical Software"},{"key":"10.1016\/S0167-8191(03)00099-1_BIB10","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1137\/0905045","article-title":"The multifrontal solution of unsymmetric sets of linear systems","volume":"5","author":"Duff","year":"1984","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"10.1016\/S0167-8191(03)00099-1_BIB11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01407861","article-title":"Task scheduling for parallel sparse Cholesky factorization","volume":"18","author":"Geist","year":"1989","journal-title":"International Journal of Parallel Programming"},{"key":"10.1016\/S0167-8191(03)00099-1_BIB12","series-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"George","year":"1981"},{"key":"10.1016\/S0167-8191(03)00099-1_BIB13","unstructured":"A. Guermouche, J.-Y. L\u2019Excellent, G. Utard, On the memory usage of a parallel multifrontal solver, Technical Report RR-4617, INRIA, 2002. Also LIP Research Report RR(2002)-42"},{"key":"10.1016\/S0167-8191(03)00099-1_BIB14","doi-asserted-by":"crossref","unstructured":"A. Guermouche, J.-Y. L\u2019Excellent, G. Utard, Analysis and improvements of the memory usage of a multifrontal solver, Technical Report RR-4829, INRIA, 2003. Also LIP Report RR(2003)-08","DOI":"10.1109\/IPDPS.2003.1213187"},{"key":"10.1016\/S0167-8191(03)00099-1_BIB15","doi-asserted-by":"crossref","unstructured":"G. Karypis, V. Kumar, MeTiS\u2013\u2013a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices\u2013\u2013Version 4.0, University of Minnesota, September 1998","DOI":"10.1006\/jpdc.1997.1403"},{"issue":"2","key":"10.1016\/S0167-8191(03)00099-1_BIB16","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/214392.214398","article-title":"Modification of the minimum degree algorithm by multiple elimination","volume":"11","author":"Liu","year":"1985","journal-title":"ACM Transactions on Mathematical Software"},{"key":"10.1016\/S0167-8191(03)00099-1_BIB17","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/6497.6499","article-title":"On the storage requirement in the out-of-core multifrontal method for sparse factorization","volume":"12","author":"Liu","year":"1986","journal-title":"ACM Transactions on Mathematical Software"},{"key":"10.1016\/S0167-8191(03)00099-1_BIB18","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 Journal on Matrix Analysis and Applications"},{"key":"10.1016\/S0167-8191(03)00099-1_BIB19","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1137\/S0895479897319313","article-title":"Performance of greedy heuristics for sparse Cholesky factorization","volume":"20","author":"Ng","year":"1999","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"10.1016\/S0167-8191(03)00099-1_BIB20","unstructured":"F. Pellegrini, Scotch 3.4 user\u2019s guide, Technical Report RR 1264-01, LaBRI, Universit\u00e9 Bordeaux I, November 2001"},{"key":"10.1016\/S0167-8191(03)00099-1_BIB21","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/(SICI)1096-9128(200002\/03)12:2\/3<69::AID-CPE472>3.0.CO;2-W","article-title":"Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering","volume":"12","author":"Pellegrini","year":"2000","journal-title":"Concurrency: Practice and Experience"},{"issue":"1","key":"10.1016\/S0167-8191(03)00099-1_BIB22","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/S1064827597322975","article-title":"Efficient methods for out-of-core sparse Cholesky factorization","volume":"21","author":"Rothberg","year":"1999","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"3","key":"10.1016\/S0167-8191(03)00099-1_BIB23","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1137\/S0895479896302692","article-title":"Node selection strategies for bottom-up sparse matrix ordering","volume":"19","author":"Rothberg","year":"1998","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"4","key":"10.1016\/S0167-8191(03)00099-1_BIB24","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1023\/A:1021908421589","article-title":"Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods","volume":"41","author":"Schulze","year":"2001","journal-title":"BIT"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000991?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000991?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T13:40:43Z","timestamp":1585143643000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819103000991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":24,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0167819103000991"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(03)00099-1","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}