{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T12:06:36Z","timestamp":1648814796966},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1995,12]]},"abstract":"<jats:p> This paper presents an integrated approach to two issues relevant to efficient parallel sparse Cholesky factorization: 1) matrix reordering for parallelism, and, 2) mapping of data to processors. A clustering heuristic is proposed to performs a fill-preserving reordering and mapping of data onto a fixed number of processors. Performance results on a Cray T3D are presented to demonstrate its effectiveness. <\/jats:p>","DOI":"10.1142\/s0129626495000606","type":"journal-article","created":{"date-parts":[[2004,11,10]],"date-time":"2004-11-10T06:14:37Z","timestamp":1100067277000},"page":"685-696","source":"Crossref","is-referenced-by-count":1,"title":["A CLUSTERING ALGORITHM FOR PARALLEL SPARSE CHOLESKY FACTORIZATION"],"prefix":"10.1142","volume":"05","author":[{"given":"BHARAT","family":"KUMAR","sequence":"first","affiliation":[{"name":"Department of Computer and Information Science, The Ohio State University, 395 Dreese Lab, 2015 Neil Avenue, Columbus, Ohio 43210, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"KALLURI","family":"ESWAR","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, The Ohio State University, 395 Dreese Lab, 2015 Neil Avenue, Columbus, Ohio 43210, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"SADAYAPPAN","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, The Ohio State University, 395 Dreese Lab, 2015 Neil Avenue, Columbus, Ohio 43210, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.-H.","family":"HUANG","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, The Ohio State University, 395 Dreese Lab, 2015 Neil Avenue, Columbus, Ohio 43210, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626495000606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T09:33:21Z","timestamp":1565170401000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626495000606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":0,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1995,12]]}},"alternative-id":["10.1142\/S0129626495000606"],"URL":"https:\/\/doi.org\/10.1142\/s0129626495000606","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}