{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:23:21Z","timestamp":1774121001372,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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":[[1996,2]]},"DOI":"10.1016\/0167-8191(95)00061-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:37:06Z","timestamp":1027611426000},"page":"327-333","source":"Crossref","is-referenced-by-count":17,"title":["A concurrent dynamic task graph"],"prefix":"10.1016","volume":"22","author":[{"given":"Theodore","family":"Johnson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timothy A.","family":"Davis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven M.","family":"Hadfield","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(95)00061-5_BIB1","series-title":"Proc. Second IEEE Symp. Parallel and Distributed Processing","first-page":"22","article-title":"LR-algorithm: Concurrent operations on priority queues","author":"Ayani","year":"1990"},{"key":"10.1016\/0167-8191(95)00061-5_BIB2","author":"Coffman","year":"1976"},{"key":"10.1016\/0167-8191(95)00061-5_BIB3","unstructured":"T.A. Davis and I.S. Duff, An unsymmetric-pattern multifrontal method for sparse LU factorization, to appear in SIAM J. Matrix Analysis and Applications. See also University of Florida, Dept. of CIS report TR-94-038."},{"key":"10.1016\/0167-8191(95)00061-5_BIB4","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. Softw."},{"key":"10.1016\/0167-8191(95)00061-5_BIB5","article-title":"On the LU factorization of sequences of identically structured sparse matrices within a distributed memory environment","author":"Hadfield","year":"1994"},{"key":"10.1016\/0167-8191(95)00061-5_BIB6","series-title":"Proc. Fifth SIAM Conf. on Applied Linear Algebra","first-page":"387","article-title":"Potential and achievable parallelism in the unsymmetric-pattern multifrontal LU factorization method for sparse matrices","author":"Hadfield","year":"1994"},{"key":"10.1016\/0167-8191(95)00061-5_BIB7","first-page":"17","article-title":"Dynamic task allocation on shared memory multiprocessor systems","volume":"I","author":"Ji","year":"1990"},{"key":"10.1016\/0167-8191(95)00061-5_BIB8","article-title":"A concurrent dynamic task graph","author":"Johnson","year":"1994"},{"key":"10.1016\/0167-8191(95)00061-5_BIB9","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1109\/TC.1984.1676376","article-title":"Practical multiprocessor scheduling algorithms for efficient parallel processing","volume":"C-33","author":"Kasahara","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(95)00061-5_BIB10","first-page":"315","article-title":"Practical multiprocessor scheduling algorithms for efficient parallel processing","volume":"C-33","author":"Klappholz","year":"1984","journal-title":"EEE Trans. Comput."},{"key":"10.1016\/0167-8191(95)00061-5_BIB11","series-title":"Int. Conf. on Parallel Processing","first-page":"315","article-title":"Parallelized process scheduling for a tightly-coupled mimd machine","author":"Klappholz","year":"1984"},{"issue":"4","key":"10.1016\/0167-8191(95)00061-5_BIB12","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1137\/0215082","article-title":"On maintaining dynamic information in a concurrent environment","volume":"15","author":"Manber","year":"1986","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/0167-8191(95)00061-5_BIB13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/103727.103729","article-title":"Algorithms for scalable synchronization on shared-memory multiprocessors","volume":"9","author":"Mellor-Crummey","year":"1991","journal-title":"ACM Trans. Comput. Syst."},{"key":"10.1016\/0167-8191(95)00061-5_BIB14","series-title":"Proc. Int. Conf. on Parallel Processing","first-page":"II68","article-title":"A non-blocking algorithm for shared queues using compare-and-swap","author":"Prakash","year":"1991"},{"key":"10.1016\/0167-8191(95)00061-5_BIB15","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0743-7315(90)90014-G","article-title":"Analysis and evaluation of heuristic methods of static task scheduling","volume":"10","author":"Shirazi","year":"1990","journal-title":"J. Parallel and Distributed Comput."},{"issue":"3","key":"10.1016\/0167-8191(95)00061-5_BIB16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1142\/S0129053391000115","article-title":"Two precedence-related task-scheduling algorithms","volume":"3","author":"Yin","year":"1991","journal-title":"Int. J. High Speed Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819195000615?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819195000615?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T01:24:01Z","timestamp":1556328241000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819195000615"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["0167819195000615"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(95)00061-5","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}