{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:08:59Z","timestamp":1759176539791},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1989,8]]},"DOI":"10.1007\/bf01407861","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T23:52:59Z","timestamp":1112485979000},"page":"291-314","source":"Crossref","is-referenced-by-count":59,"title":["Task scheduling for parallel sparse Cholesky factorization"],"prefix":"10.1007","volume":"18","author":[{"given":"G. A.","family":"Geist","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","series-title":"Technical Report ORNL-6211","volume-title":"Parallel Cholesky factorization on a hypercube multiprocessor","author":"G. A. Geist","year":"1985","unstructured":"G. A. Geist and M. T. Heath, Parallel Cholesky factorization on a hypercube multiprocessor, Technical Report ORNL-6211, Oak Ridge National Laboratory, Oak Ridge, Tennessee (1985)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF01407878","volume":"15","author":"J. A. George","year":"1986","unstructured":"J. A. George, M. T. Heath, J. W-H. Liu, and E. G-Y. Ng, Solution of sparse positive definite systems on a shared memory multiprocessor,Int'l. J. Parallel Programming,15:309?325 (1986).","journal-title":"Int'l. J. Parallel Programming"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1137\/0909021","volume":"9","author":"J. A. George","year":"1988","unstructured":"J. A. George, M. T. Heath, J. W-H. Liu, and E. G-Y. Ng, Sparse Cholesky factorization on a local-memory multiprocessor,SIAM J. Sci. Stat. Comput. 9:327?340 (1988).","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0167-8191(89)90101-4","volume":"10","author":"J. A. George","year":"1989","unstructured":"J. A. George, J. W-H. Liu, and E. G-Y. Ng, Communication results for parallel sparse Cholesky factorization on a hypercube,Parallel Computing 10:287?298 (1989).","journal-title":"Parallel Computing"},{"key":"CR5","unstructured":"P. Sadayappan and V. Visvanathan, Distributed sparse factorization of circuit matrices via recursive E-tree partitioning,SIAM Symposium on Sparse Matrices, Gleneden Beach, Oregon (1989)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0167-8191(86)90019-0","volume":"3","author":"I. S. Duff","year":"1986","unstructured":"I. S. Duff, Parallel implementation of multifrontal schemes,Parallel Computing 3:193?204 (1986).","journal-title":"Parallel Computing"},{"key":"CR7","volume-title":"The multifrontal method in a parallel environment","author":"I. S. Duff","year":"1987","unstructured":"I. S. Duff, N.I.M. Gould, M. Lescrenier, and J. K. Reid, The multifrontal method in a parallel environment, Technical Report CSS 211, Computer Science and Systems Division, Harwell (1987)."},{"key":"CR8","volume-title":"Sparse Cholesky Factorization on a Multiprocessor","author":"E. Zmijewski","year":"1987","unstructured":"E. Zmijewski, Sparse Cholesky Factorization on a Multiprocessor, PhD thesis, Department of Computer Science, Cornell University, Ithaca, New York (August 1987)."},{"key":"CR9","volume-title":"A parallel algorithm for large sparse Cholesky factorization on a multiprocessor","author":"E. Zmijewski","year":"1986","unstructured":"E. Zmijewski and J. R. Gilbert, A parallel algorithm for large sparse Cholesky factorization on a multiprocessor. Technical Report TR 86-733, Department of Computer Science, Cornell University, Ithaca, New York (1986)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/BF01388998","volume":"16","author":"J. R. Gilbert","year":"1987","unstructured":"J. R. Gilbert and E. Zmijewski, A parallel graph partitioning algorithm for a messagepassing multiprocessor.Int'l. J. Parallel Programming 16:427?449 (1987).","journal-title":"Int'l. J. Parallel Programming"},{"key":"CR11","unstructured":"C. E. Leiserson and J. G. Lewis, Orderings for parallel sparce symmetric factorization, Technical Report, Boeing Computer Services Company (1987)."},{"key":"CR12","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"J. A. George","year":"1981","unstructured":"J. A. George and J. W-H. Liu,Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall Inc., Englewood Cliffs, New Jersey (1981)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0167-8191(89)90064-1","volume":"11","author":"J. W-H. Liu","year":"1989","unstructured":"J. W-H. Liu, Reordering sparse matrices for parallel elimination,Parallel Computing,11:73?91 (1989).","journal-title":"Parallel Computing"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J. W-H. Liu","year":"1990","unstructured":"J. W-H. Liu, The role of elimination trees in sparse factorization,SIAM J. Matrix Anal. & Appl. 11:134?172 (1990).","journal-title":"SIAM J. Matrix Anal. & Appl."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1137\/0710032","volume":"10","author":"J. A. George","year":"1973","unstructured":"J. A. George, Nested dissection of a regular finite element mesh,SIAM J. Numer. Anal. 10:345?363 (1973).","journal-title":"SIAM J. Numer. Anal."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1137\/0715069","volume":"15","author":"J. A. George","year":"1978","unstructured":"J. A. George and J. W-H. Liu, An automatic nested dissection algorithm for irregular finite element problems,SIAM J. Numer. Anal. 15:1053?1069 (1978).","journal-title":"SIAM J. Numer. Anal."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1031001","volume":"31","author":"J. A. George","year":"1989","unstructured":"J. A. George and J. W-H. Liu, The evolution of the minimum degree ordering algorithm,SIAM Review 31:1?19 (1989).","journal-title":"SIAM Review"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/214392.214398","volume":"11","author":"J. W-H. Liu","year":"1985","unstructured":"J. W-H. Liu, Modification of the minimum degree algorithm by multiple elimination,ACM Trans. on Math. Software 11:141?153 (1985).","journal-title":"ACM Trans. on Math. Software"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/6497.6499","volume":"12","author":"J. W-H. Liu","year":"1986","unstructured":"J. W-H. Liu, A compact row storage scheme for Cholesky factors using elimination trees,ACM Trans. on Math. Software 12:127?148 (1986).","journal-title":"ACM Trans. on Math. Software"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0377-0427(89)90364-6","volume":"27","author":"J. A. George","year":"1989","unstructured":"J. A. George, M. T. Heath, J. W-H. Liu, and E. G-Y. Ng, Solution of sparse positive definite systems on a hypercube,J. Comp. & Appl. Math. 27:129?156 (1989).","journal-title":"J. Comp. & Appl. Math."},{"key":"CR21","volume-title":"The art of computer programming, Volume 3: Sorting and searching","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth,The art of computer programming, Volume 3: Sorting and searching. Addison-Wesley, Reading, Massachusetts (1973)."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01407861.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01407861\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01407861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T06:00:40Z","timestamp":1556863240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01407861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["BF01407861"],"URL":"https:\/\/doi.org\/10.1007\/bf01407861","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}