{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:58:40Z","timestamp":1649177920377},"reference-count":19,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"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":[[1999,9]]},"DOI":"10.1016\/s0167-8191(99)00027-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T14:52:00Z","timestamp":1049727120000},"page":"943-967","source":"Crossref","is-referenced-by-count":4,"title":["Minimum communication cost reordering for parallel sparse Cholesky factorization"],"prefix":"10.1016","volume":"25","author":[{"given":"Wen-Yang","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuen-Liang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(99)00027-7_BIB1","doi-asserted-by":"crossref","unstructured":"J.R.S. Blair, B.W. Peyton, On finding minimum-diameter clique trees, Tech. Report ORNL\/TM-11850, Oak Ridge National Laboratory, Oak Ridge, TN, 1991","DOI":"10.2172\/5217041"},{"key":"10.1016\/S0167-8191(99)00027-7_BIB2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/1026003","article-title":"Implementing linear algebra algorithms for dense matrices on a vector pipeline machine","volume":"26","author":"Dongarra","year":"1984","journal-title":"SIAM Review"},{"key":"10.1016\/S0167-8191(99)00027-7_BIB3","series-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"George","year":"1981"},{"key":"10.1016\/S0167-8191(99)00027-7_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1031001","article-title":"The evolution of the minimum degree ordering algorithm","volume":"31","author":"George","year":"1989","journal-title":"SIAM Review"},{"key":"10.1016\/S0167-8191(99)00027-7_BIB5","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1137\/0913067","article-title":"Highly parallel sparse Cholesky factorization","volume":"13","author":"Gilbert","year":"1992","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"10.1016\/S0167-8191(99)00027-7_BIB6","series-title":"Algorithmic Graph Theory and Perfect Graph","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0167-8191(99)00027-7_BIB7","unstructured":"A. Gupta, V. Kumar, Optimally scalable parallel sparse Cholesky factorization, in: Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, SIAM (1995) 442\u2013447"},{"key":"10.1016\/S0167-8191(99)00027-7_BIB8","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1137\/1033099","article-title":"Parallel algorithms for sparse linear systems","volume":"33","author":"Heath","year":"1991","journal-title":"SIAM Review"},{"key":"10.1016\/S0167-8191(99)00027-7_BIB9","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1978"},{"key":"10.1016\/S0167-8191(99)00027-7_BIB10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1109\/TC.1982.1675979","article-title":"A data structure for parallel L\/U decomposition","volume":"31","author":"Jess","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(99)00027-7_BIB11","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1137\/0910070","article-title":"A fast algorithm for reordering sparse matrices for parallel factorization","volume":"10","author":"Lewis","year":"1989","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"10.1016\/S0167-8191(99)00027-7_BIB12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/214392.214398","article-title":"Modification of the minimum degree algorithm by multiple elimination","volume":"12","author":"Liu","year":"1985","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0167-8191(99)00027-7_BIB13","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0167-8191(86)90014-1","article-title":"Computational models and task scheduling for parallel sparse Cholesky factorizations","volume":"3","author":"Liu","year":"1986","journal-title":"Parallel Comput."},{"key":"10.1016\/S0167-8191(99)00027-7_BIB14","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0167-8191(89)90064-1","article-title":"Reordering sparse matrices for parallel elimination","volume":"11","author":"Liu","year":"1989","journal-title":"Parallel Comput."},{"key":"10.1016\/S0167-8191(99)00027-7_BIB15","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","article-title":"Triangulated graphs and the elimination process","volume":"32","author":"Rose","year":"1970","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/S0167-8191(99)00027-7_BIB16","series-title":"Graph Theory and Computing","first-page":"183","article-title":"A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations","author":"Rose","year":"1972"},{"key":"10.1016\/S0167-8191(99)00027-7_BIB17","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1137\/S106482759426715X","article-title":"Performance of panel and block approaches to sparse Cholesky factorization on the iPSC\/860 and Paragon multicomputers","volume":"17","author":"Rothberg","year":"1996","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0167-8191(99)00027-7_BIB18","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1137\/0915085","article-title":"An efficient block-oriented approach to parallel sparse Cholesky factorization","volume":"15","author":"Rothberg","year":"1994","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0167-8191(99)00027-7_BIB19","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1145\/356004.356006","article-title":"A new implementation of sparse Gaussian elimination","volume":"8","author":"Schreiber","year":"1982","journal-title":"ACM Trans. Math. Software"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819199000277?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819199000277?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T03:22:23Z","timestamp":1555557743000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819199000277"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":19,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["S0167819199000277"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(99)00027-7","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}