{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T11:33:59Z","timestamp":1766748839798},"reference-count":25,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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":[[1993,11]]},"DOI":"10.1016\/0167-8191(93)90029-k","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"1235-1257","source":"Crossref","is-referenced-by-count":28,"title":["Minimizing the communication time for matrix multiplication on multiprocessors"],"prefix":"10.1016","volume":"19","author":[{"given":"S.Lennart","family":"Johnsson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(93)90029-K_BIB1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0743-7315(91)90033-6","article-title":"Optimal communication algorithms for hypercubes","volume":"11","author":"Bertsekas","year":"1991","journal-title":"J. Parallel Distributed Comput."},{"issue":"3","key":"10.1016\/0167-8191(93)90029-K_BIB2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1177\/109434209200600303","article-title":"All-to-all broadcast with applications on the Connection Machine","volume":"6","author":"Brunet","year":"1992","journal-title":"Internat. J. Supercomput. Appl."},{"key":"10.1016\/0167-8191(93)90029-K_BIB3","series-title":"PhD thesis","article-title":"A cellular computer to implement the Kalman filter algorithm","author":"Cannon","year":"1969"},{"key":"10.1016\/0167-8191(93)90029-K_BIB4","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0210049","article-title":"Parallel matrix and graph algorithms","volume":"10","author":"Dekel","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8191(93)90029-K_BIB5","series-title":"Technical Report Reprint No. 1","article-title":"A set of level 3 basic linear algebra subprograms","author":"Dongarra","year":"1988"},{"key":"10.1016\/0167-8191(93)90029-K_BIB6","series-title":"Technical Report Technical Memorandum 41","article-title":"An extended set of Fortran basic linear algebra subprograms","author":"Dongarra","year":"1986"},{"key":"10.1016\/0167-8191(93)90029-K_BIB7","series-title":"Technical Report TR90-141","article-title":"Fortran D language specification","author":"Fox","year":"1990"},{"key":"10.1016\/0167-8191(93)90029-K_BIB8","series-title":"Technical Report CCCP-314","article-title":"Optimal communication algorithms on the hypercube","author":"Fox","year":"1986"},{"issue":"2","key":"10.1016\/0167-8191(93)90029-K_BIB9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0743-7315(87)90002-5","article-title":"Communication efficient basic linear algebra computations on hypercube architectures","volume":"4","author":"Johnsson","year":"1987","journal-title":"J. Parallel Distributed Comput."},{"issue":"4","key":"10.1016\/0167-8191(93)90029-K_BIB10","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0743-7315(91)90002-Q","article-title":"Performance modeling of distributed memory architectures","volume":"12","author":"Johnsson","year":"1991","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0167-8191(93)90029-K_BIB11","series-title":"Supercomputing 89","first-page":"326","article-title":"Matrix multiplication on the Connection Machine","author":"Johnsson","year":"1989"},{"key":"10.1016\/0167-8191(93)90029-K_BIB12","series-title":"Technical Report YALEU\/DCS\/RR-569","article-title":"Algorithms for multiplying matrices of arbitrary shapes using shared memory primitives on a Boolean cube","author":"Johnsson","year":"1987"},{"key":"10.1016\/0167-8191(93)90029-K_BIB13","series-title":"Parallel Processing and Medium Scale Multiprocessors","first-page":"108","article-title":"Matrix multiplication on Boolean cubes using generic communication primitives","author":"Johnsson","year":"1989"},{"issue":"9","key":"10.1016\/0167-8191(93)90029-K_BIB14","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","article-title":"Spanning graphs for optimum broadcasting and personalized communication in hypercubes","volume":"38","author":"Johnsson","year":"1989","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0167-8191(93)90029-K_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-7315(92)90039-P","article-title":"Generalized shuffle permutations on Boolean cubes","volume":"16","author":"Johnsson","year":"1992","journal-title":"J. Parallel Distributed Comput."},{"issue":"3","key":"10.1016\/0167-8191(93)90029-K_BIB16","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1145\/355841.355847","article-title":"Basic linear algebra subprograms for Fortran usage","volume":"5","author":"Lawson","year":"1979","journal-title":"ACM TOMS"},{"key":"10.1016\/0167-8191(93)90029-K_BIB17","series-title":"Matrix multiplication on a three-dimensional array","author":"Mathur","year":"1991"},{"key":"10.1016\/0167-8191(93)90029-K_BIB18","series-title":"Technical Report 216","article-title":"Multiplication of matrices of arbitrary shape on a Data Parallel Computer","author":"Mathur","year":"1991"},{"key":"10.1016\/0167-8191(93)90029-K_BIB19","series-title":"Technical report 243","article-title":"All-to-all communication","author":"Mathur","year":"1992"},{"issue":"4","key":"10.1016\/0167-8191(93)90029-K_BIB20","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1109\/TC.1982.1676004","article-title":"Optimal BPC permutations on a cube connected SIMD computer","volume":"C-31","author":"Nassimi","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90029-K_BIB21","series-title":"Combinatorial Algorithms","author":"Reingold","year":"1977"},{"key":"10.1016\/0167-8191(93)90029-K_BIB22","series-title":"Technical Report CRL-TR-9-87","article-title":"Intensive hypercube communication I: prearranged communication in link-bound machines","author":"Stout","year":"1987"},{"key":"10.1016\/0167-8191(93)90029-K_BIB23","series-title":"Hypercube Multiprocessors 1987","article-title":"Passing messages in link-bound hypercubes","author":"Stout","year":"1987"},{"key":"10.1016\/0167-8191(93)90029-K_BIB24","series-title":"CM-200 Technical Summary","author":"Thinking Machines Corp","year":"1991"},{"key":"10.1016\/0167-8191(93)90029-K_BIB25","article-title":"Vienna Fortran \u2014 A language specification version 1.1","author":"Zima","year":"1992","journal-title":"Technical report, ICASE, Interim Report 21"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390029K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390029K?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:28:11Z","timestamp":1551068891000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919390029K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":25,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["016781919390029K"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(93)90029-k","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}