{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T15:45:26Z","timestamp":1778168726650,"version":"3.51.4"},"reference-count":16,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":[[1992,7]]},"DOI":"10.1016\/0167-8191(92)90041-5","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"719-741","source":"Crossref","is-referenced-by-count":27,"title":["Parallel ICCG on a hierarchical memory multiprocessor \u2014 Addressing the triangular solve bottleneck"],"prefix":"10.1016","volume":"18","author":[{"given":"Edward","family":"Rothberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anoop","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(92)90041-5_BIB1","series-title":"Proc. 15th Annual Internat. Symp. on Computer Architecture","first-page":"355","article-title":"An economical solution to the cache coherence problem","author":"Archibald","year":"1985"},{"key":"10.1016\/0167-8191(92)90041-5_BIB2","article-title":"Parallel implementation of preconditioned conjugate gradient methods for solving sparse systems of linear equations","volume":"805","author":"Anderson","year":"1988"},{"key":"10.1016\/0167-8191(92)90041-5_BIB3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1142\/S0129053389000056","article-title":"Solving sparse triangular linear systems on parallel computers","volume":"1","author":"Anderson","year":"1989","journal-title":"Internat. J. High Speed Comput."},{"key":"10.1016\/0167-8191(92)90041-5_BIB4","first-page":"468","article-title":"The 4D-MP graphics superworkstation: Computing+graphics = 40 MIPS + 40 MFLOPS and 100,000 lighted polygons per second","volume":"88","author":"Baskett","year":"1988","journal-title":"COMPCON"},{"key":"10.1016\/0167-8191(92)90041-5_BIB5","article-title":"Preconditioned Krylov solvers and methods for runtime loop parallelization","author":"Baxter","year":"1988","journal-title":"YALEU\/DCS\/TR-655"},{"key":"10.1016\/0167-8191(92)90041-5_BIB6","article-title":"A proposed radix- and world-length-independent standard for floating-point arithmetic","volume":"16","author":"Cody","year":"1984","journal-title":"IEEE Comput."},{"key":"10.1016\/0167-8191(92)90041-5_BIB7","series-title":"Studies in Numerical Analysis","first-page":"179","article-title":"A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations","author":"Concus","year":"1984"},{"key":"10.1016\/0167-8191(92)90041-5_BIB8","article-title":"Tango: A multiprocessor simulation and tracing system","author":"Davis","year":"1991"},{"key":"10.1016\/0167-8191(92)90041-5_BIB9","article-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0167-8191(92)90041-5_BIB10","article-title":"Solving sparse triangular linear systems using FORTRAN with parallel extensions on the NYU Ultracomputer prototype","author":"Greenbaum","year":"1986"},{"key":"10.1016\/0167-8191(92)90041-5_BIB11","article-title":"Efficient ICCG on a shared memory multiprocessor","author":"Hammond","year":"1989"},{"key":"10.1016\/0167-8191(92)90041-5_BIB12","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","article-title":"Methods of conjugate gradients for solving linear systems","volume":"49","author":"Hestenes","year":"1952","journal-title":"J. Res. Nat. Bureau Standards"},{"key":"10.1016\/0167-8191(92)90041-5_BIB13","first-page":"148","article-title":"An iterative solution method for linear equation systems of which the coefficient matrix is a symmetric M-Matrix","volume":"31","author":"Meijerink","year":"1977","journal-title":"Math. Comp."},{"key":"10.1016\/0167-8191(92)90041-5_BIB14","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0743-7315(91)90014-Z","article-title":"Tolerating latency through software-controlled prefetching in scalable shared-memory multiprocessors","volume":"12","author":"Mowry","year":"1991","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0167-8191(92)90041-5_BIB15","doi-asserted-by":"crossref","DOI":"10.1145\/55364.55412","article-title":"A benchmark package for sparse matrix computations","author":"Saad","year":"1988"},{"key":"10.1016\/0167-8191(92)90041-5_BIB16","article-title":"Run-time parallelization and scheduling of loops","author":"Saltz","year":"1988"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819192900415?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819192900415?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T04:27:07Z","timestamp":1551068827000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819192900415"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":16,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["0167819192900415"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(92)90041-5","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}