{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:08:45Z","timestamp":1759176525090},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"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":[[1990,11]]},"DOI":"10.1016\/0167-8191(90)90156-4","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T06:10:42Z","timestamp":1060323042000},"page":"27-40","source":"Crossref","is-referenced-by-count":11,"title":["Communication and matrix computations on large message passing systems"],"prefix":"10.1016","volume":"16","author":[{"given":"G.W.","family":"Stewart","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(90)90156-4_BIB1","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.1109\/TC.1987.5009502","article-title":"The WARP computer: architecture, implementation, and performance","volume":"C-36","author":"Annoratone","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90156-4_BIB2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1137\/0908009","article-title":"The WY representation for products of Householder transformation","volume":"8","author":"Bishof","year":"1987","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0167-8191(90)90156-4_BIB3","series-title":"Computational Algorithms for Closed Queueing Networks","author":"Bruell","year":"1980"},{"key":"10.1016\/0167-8191(90)90156-4_BIB4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/36318.36319","article-title":"A proposal for a set of level 3 basic linear algebra subprograms","volume":"22","author":"Dongarra","year":"1987","journal-title":"SIGNUM Newsl."},{"key":"10.1016\/0167-8191(90)90156-4_BIB5","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1137\/0909038","article-title":"Modified cyclic algorithms for solving triangular systems on distributed-memory multiprocessors","volume":"9","author":"Eisentat","year":"1988","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0167-8191(90)90156-4_BIB6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0167-8191(87)90060-3","article-title":"Matrix algorithms on a hypercube I: matrix multiplication","volume":"4","author":"Fox","year":"1987","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(90)90156-4_BIB7","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0024-3795(86)90167-9","article-title":"Parallel Cholesky factorization on a shared-memory multiprocessor","volume":"77","author":"George","year":"1986","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0167-8191(90)90156-4_BIB8","series-title":"Matrix Computations","author":"Golub","year":"1983"},{"key":"10.1016\/0167-8191(90)90156-4_BIB9","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1137\/0909041","article-title":"Development of parallel methods for a 1024-processor hypercube","volume":"9","author":"Gustafson","year":"1988","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0167-8191(90)90156-4_BIB10","article-title":"Exploiting fast matrix multiplication within the level 4 BLAS","author":"Higham","year":"1989"},{"key":"10.1016\/0167-8191(90)90156-4_BIB11","article-title":"Spanning graphs for optimum broadcasting and personalized communication in hypercubes","author":"Lennart Johnsson","year":"1986"},{"key":"10.1016\/0167-8191(90)90156-4_BIB12","article-title":"Matrix multiplication on Boolean cubes using generic communication primitives","author":"Lennart Johnsson","year":"1987"},{"key":"10.1016\/0167-8191(90)90156-4_BIB13","article-title":"MATLAB User's Guide","author":"Moler","year":"1982"},{"key":"10.1016\/0167-8191(90)90156-4_BIB14","article-title":"The Maryland CRAB: a module for building parallel computers","author":"O'Leary","year":"1986"},{"key":"10.1016\/0167-8191(90)90156-4_BIB15","series-title":"How to Multiply Matrices Faster","author":"Pan","year":"1984"},{"key":"10.1016\/0167-8191(90)90156-4_BIB16","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0167-8191(87)90017-2","article-title":"A parallel implementation of the QR algorithm","volume":"5","author":"Stewart","year":"1987","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(90)90156-4_BIB17","series-title":"Large Scale Eigenvalue Problems","first-page":"181","article-title":"Examples of Eigenvalue\/vector use in electric power system problems","author":"Van Ness","year":"1986"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819190901564?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819190901564?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T01:26:21Z","timestamp":1552613181000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819190901564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["0167819190901564"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90156-4","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}