乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T15:57:41Z","timestamp":1694620661809},"reference-count":39,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100002541","name":"Pohang University of Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002541","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0167-8191(02)00220-x","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T19:52:57Z","timestamp":1042833177000},"page":"135-159","source":"Crossref","is-referenced-by-count":3,"title":["Task scheduling using a block dependency DAG for block-oriented sparse Cholesky factorization"],"prefix":"10.1016","volume":"29","author":[{"given":"Heejo","family":"Lee","sequence":"first","affiliation":[]},{"given":"Jong","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Sung Je","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Sunggu","family":"Lee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(02)00220-X_BIB1","unstructured":"C.C. Ashcraft, The domain\/segment partition for the factorization of sparse symmetric positive definite matrices, Technical report, Boeing Computer Services, Seattle, Washington, 1990. ECA-TR-148"},{"key":"10.1016\/S0167-8191(02)00220-X_BIB2","unstructured":"C.C. Ashcraft, SPOOLES: An object-oriented sparse matrix library, In Proc. of 1999 SIAM Conference on Parallel Processing for Scientific Computing, March 1999"},{"key":"10.1016\/S0167-8191(02)00220-X_BIB3","doi-asserted-by":"crossref","unstructured":"C.C. Ashcraft, S. Eisenstat, J. Liu, A. Sherman, A comparison of three column-based distributed sparse factorization schemes, Technical report, Department of Computer Science, Yale University, New Haven, CT, 1990, YALEU\/DCS\/RR-810","DOI":"10.21236\/ADA228143"},{"issue":"4","key":"10.1016\/S0167-8191(02)00220-X_BIB4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/76909.76910","article-title":"The influence of relaxed supernode partitions on the multifrontal method","volume":"15","author":"Ashcraft","year":"1989","journal-title":"ACM Trans. Math. Software"},{"issue":"4","key":"10.1016\/S0167-8191(02)00220-X_BIB5","first-page":"10","article-title":"Progress in sparse matrix methods for large linear systems on vector supercomputers","volume":"1","author":"Ashcraft","year":"1987","journal-title":"Int. J. Supercomput. Appl."},{"issue":"1","key":"10.1016\/S0167-8191(02)00220-X_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/77626.79170","article-title":"A set of level 3 basic linear algebra subprograms","volume":"16","author":"Dongarra","year":"1990","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0167-8191(02)00220-X_BIB7","article-title":"Numerical Linear Algebra for High Performance Computers","author":"Dongarra","year":"1998","journal-title":"SIAM"},{"key":"10.1016\/S0167-8191(02)00220-X_BIB8","unstructured":"I.S. Duff, Sparse numerical linear algebra: Direct methods and preconditioning, Technical report, CERFACS, Toulouse Cedex, France, 1996. TR\/PA\/96\/22"},{"key":"10.1016\/S0167-8191(02)00220-X_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/62038.62043","article-title":"Sparse matrix test problems","volume":"15","author":"Duff","year":"1989","journal-title":"ACM Trans. Math. Software"},{"issue":"1","key":"10.1016\/S0167-8191(02)00220-X_BIB10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1019122726788","article-title":"Two-dimensional block partitionings for the parallel sparse cholesky factorization","volume":"16","author":"Dumitrescu","year":"1997","journal-title":"Numer. Algorithms"},{"key":"10.1016\/S0167-8191(02)00220-X_BIB11","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1006\/jpdc.1997.1319","article-title":"Run-time techniques for exploiting irregular task parallelism on distributed memory architectures","volume":"42","author":"Fu","year":"1997","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0167-8191(02)00220-X_BIB12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0024-3795(86)90167-9","article-title":"Parallel cholesky factorization on a shared memory processor","volume":"77","author":"George","year":"1986","journal-title":"Lin. Algebra Appl."},{"key":"10.1016\/S0167-8191(02)00220-X_BIB13","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1137\/0909021","article-title":"Sparse cholesky factorization on a local memory multiprocessor","volume":"9","author":"George","year":"1988","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"10.1016\/S0167-8191(02)00220-X_BIB14","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/0743-7315(92)90012-C","article-title":"Comparison of clustering heuristics for scheduling DAGs on multiprocessors","author":"Gerasoulis","year":"1992","journal-title":"J. Parallel Distrib. Comput."},{"issue":"6","key":"10.1016\/S0167-8191(02)00220-X_BIB15","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1109\/71.242154","article-title":"On the granularity and clustering directed acyclic task graphs","volume":"4","author":"Gerasoulis","year":"1993","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"5","key":"10.1016\/S0167-8191(02)00220-X_BIB16","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1109\/71.598277","article-title":"Highly scalable parallel algorithms for sparse matrix factorization","volume":"8","author":"Gupta","year":"1997","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/S0167-8191(02)00220-X_BIB17","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1137\/1033099","article-title":"Parallel algorithms for sparse linear systems","author":"Heath","year":"1991","journal-title":"SIAM Rev."},{"key":"10.1016\/S0167-8191(02)00220-X_BIB18","doi-asserted-by":"crossref","unstructured":"P. Henon, P. Ramet, J. Roman, A Mapping and Scheduling Algorithm for Parallel Sparse Fan-In Numerical Factorization, in: EuroPAR\u201999, 1999, pp. 1059\u20131067","DOI":"10.1007\/3-540-48311-X_148"},{"key":"10.1016\/S0167-8191(02)00220-X_BIB19","doi-asserted-by":"crossref","unstructured":"P. Henon, P. Ramet, J. Roman, PaStiX: A Parallel Sparse Direct Solver Based on a Static Scheduling for Mixed 1D\/2D Block Distributions, in: Irregular\u20192000, 2000","DOI":"10.1007\/3-540-45591-4_70"},{"key":"10.1016\/S0167-8191(02)00220-X_BIB20","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1137\/0912063","article-title":"Limiting communication in parallel sparse cholesky factorization","volume":"12","author":"Hulbert","year":"1991","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"5","key":"10.1016\/S0167-8191(02)00220-X_BIB21","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/71.503776","article-title":"Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors","volume":"7","author":"Kwok","year":"1996","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/S0167-8191(02)00220-X_BIB22","unstructured":"H. Lee, Scheduling and Processor Allocation of Matrix Computations on Parallel Systems, PhD thesis, Pohang University of Science and Technology, January 2000"},{"key":"10.1016\/S0167-8191(02)00220-X_BIB23","doi-asserted-by":"crossref","unstructured":"H. Lee, J. Kim, S.J. Hong, S. Lee, Task scheduling using a block dependency dag for block-oriented sparse cholesky factorization, in: Proceedings of 14-th ACM Symposium on Applied Computing, March 2000, pp. 641\u2013648","DOI":"10.1145\/338407.338535"},{"issue":"2","key":"10.1016\/S0167-8191(02)00220-X_BIB24","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1137\/0716027","article-title":"Generalized nested dissection","volume":"16","author":"Lipton","year":"1979","journal-title":"SIAM J. Numer. Anal."},{"issue":"5","key":"10.1016\/S0167-8191(02)00220-X_BIB25","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1137\/0914063","article-title":"Block sparse cholesky algorithms on advanced uniprocessor computers","volume":"14","author":"Ng","year":"1993","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"10.1016\/S0167-8191(02)00220-X_BIB26","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(02)00220-X_BIB27","series-title":"Introduction to Parallel and Vector Solution of Linear Systems","author":"Ortega","year":"1988"},{"issue":"1","key":"10.1016\/S0167-8191(02)00220-X_BIB28","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/71.481597","article-title":"Task clustering and scheduling for distributed memory parallel architectures","volume":"7","author":"Palis","year":"1996","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"10.1016\/S0167-8191(02)00220-X_BIB29","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(02)00220-X_BIB30","unstructured":"E. Rothberg, A. Gupta, The performance impact of data reuse in parallel dense cholesky factorization, Technical report, Stanford University, 1992"},{"issue":"6","key":"10.1016\/S0167-8191(02)00220-X_BIB31","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(02)00220-X_BIB32","doi-asserted-by":"crossref","unstructured":"E. Rothberg, R. Schreiber, Improved load distribution in parallel sparse cholesky factorization, in: Proceedings of Supercomputing\u201994, 1994, pp. 783\u2013792","DOI":"10.1145\/602770.602897"},{"key":"10.1016\/S0167-8191(02)00220-X_BIB33","series-title":"Partitioning and Scheduling Parallel Programs for Multiprocessors","author":"Sarkar","year":"1989"},{"key":"10.1016\/S0167-8191(02)00220-X_BIB34","first-page":"191","article-title":"Scalability of sparse direct solvers","volume":"vol. 56","author":"Schreiber","year":"1993"},{"key":"10.1016\/S0167-8191(02)00220-X_BIB35","doi-asserted-by":"crossref","unstructured":"K. Shen, X. Jiao, T. Yang, Elimination forest guided 2D sparse LU factorization, in: Proceedings of ACM Symposium on Parallel Algorithm and Architecture, 1998, pp. 5\u201315","DOI":"10.1145\/277651.277658"},{"key":"10.1016\/S0167-8191(02)00220-X_BIB36","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-8191(90)90056-F","article-title":"Multiprocessor scheduling with communication delays","volume":"16","author":"Veltman","year":"1990","journal-title":"Parallel Comput."},{"issue":"6","key":"10.1016\/S0167-8191(02)00220-X_BIB37","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1145\/295656.295660","article-title":"Space\/time-efficient scheduling and execution of parallel irregular computations","volume":"20","author":"Yang","year":"1998","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"10.1016\/S0167-8191(02)00220-X_BIB38","doi-asserted-by":"crossref","unstructured":"T. Yang, A. Gerasoulis, PYRROS: Static task scheduling and code generation for message passing multiprocessors, in: Proceedings of 6th ACM International Conference on Supercomputing, 1992, pp. 428\u2013437","DOI":"10.1145\/143369.143446"},{"issue":"9","key":"10.1016\/S0167-8191(02)00220-X_BIB39","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1109\/71.308533","article-title":"DSC: scheduling parallel tasks on an unbounded number of processors","volume":"5","author":"Yang","year":"1994","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781910200220X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781910200220X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T09:27:19Z","timestamp":1656235639000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016781910200220X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S016781910200220X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(02)00220-x","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}