{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T19:44:53Z","timestamp":1751053493957},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,11,1]],"date-time":"1989-11-01T00:00:00Z","timestamp":625881600000},"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":[[1989,11]]},"DOI":"10.1016\/0167-8191(89)90057-4","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"249-254","source":"Crossref","is-referenced-by-count":6,"title":["An even faster systolic array for matrix multiplication"],"prefix":"10.1016","volume":"12","author":[{"given":"Abdelhamid","family":"Benaini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"Robert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(89)90057-4_BIB1","article-title":"Conception et validation des algorithmes systoliques","author":"Benaini","year":"1988"},{"key":"10.1016\/0167-8191(89)90057-4_BIB2","series-title":"Parallel Distributed Algorithms","first-page":"79","article-title":"Matrix product on linear systolic arrays","author":"Benaini","year":"1989"},{"key":"10.1016\/0167-8191(89)90057-4_BIB3","series-title":"Foundations of Software Technology and Theoretical Computer Science","first-page":"428","article-title":"VLSI systems for matrix multiplication","volume":"206","author":"Cheng","year":"1985"},{"key":"10.1016\/0167-8191(89)90057-4_BIB4","series-title":"Parallel Algorithms and Architectures","year":"1986"},{"issue":"1","key":"10.1016\/0167-8191(89)90057-4_BIB5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1109\/12.8739","article-title":"A family of new efficient arrays for matrix multiplication","volume":"38","author":"Jagadish","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90057-4_BIB6","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0167-8191(88)90078-6","article-title":"A two-layered mesh array for matrix multiplication","volume":"6","author":"Kak","year":"1988","journal-title":"Parallel Comput."},{"issue":"1","key":"10.1016\/0167-8191(89)90057-4_BIB7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MC.1982.1653825","article-title":"Why systolic architectures","volume":"15","author":"Kung","year":"1982","journal-title":"Computer"},{"issue":"1","key":"10.1016\/0167-8191(89)90057-4_BIB8","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/0743-7315(84)90010-8","article-title":"Fault-tolerance and two-level pipelining in VLSI systolic arrays","volume":"1","author":"Kung","year":"1984","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0167-8191(89)90057-4_BIB9","series-title":"Proc. ACM-SIGMOD","first-page":"105","article-title":"Systolic VLSI arrays for relational data base operations","author":"Kung","year":"1980"},{"key":"10.1016\/0167-8191(89)90057-4_BIB10","series-title":"Introduction to VLSI Systems","first-page":"271","article-title":"Systolic arrays for (VLSI)","author":"Kung","year":"1980"},{"issue":"1","key":"10.1016\/0167-8191(89)90057-4_BIB11","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/TC.1985.1676516","article-title":"The design of optimal systolic arrays","volume":"34","author":"Li","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90057-4_BIB12","series-title":"IEEE Int. Symp. on Computer Architectures","article-title":"A language for the simulation of systolic architectures","author":"Melhem","year":"1985"},{"issue":"5","key":"10.1016\/0167-8191(89)90057-4_BIB13","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1109\/TC.1987.1676946","article-title":"Complexity of matrix product on a class of orthogonally connected systolic arrays","volume":"36","author":"Melkemi","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90057-4_BIB14","series-title":"Parallel Computing 85","first-page":"187","article-title":"I\/O trade-offs matrix product on programmable arrays","author":"Melkemi","year":"1986"},{"key":"10.1016\/0167-8191(89)90057-4_BIB15","series-title":"Parallel Algorithms and Architectures","first-page":"269","article-title":"Algebraic and combinatorial aspects of systolic algorithms for some linear problems","author":"Melkemi","year":"1986"},{"key":"10.1016\/0167-8191(89)90057-4_BIB16","series-title":"Proc. 24th Annual Allerton Conference on Communication, Control and Computing","article-title":"Cylindrical arrays for matrix multiplication","author":"Porter","year":"1986"},{"issue":"2","key":"10.1016\/0167-8191(89)90057-4_BIB17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(80)90006-X","article-title":"Area-time optimal VLSI networks for multiplying matrices","volume":"11","author":"Preparata","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(89)90057-4_BIB18","series-title":"Automata Networks in Computer Science","first-page":"229","article-title":"Systematic design of systolic arrays","author":"Quinton","year":"1987"},{"key":"10.1016\/0167-8191(89)90057-4_BIB19","series-title":"Parallel Algorithms and Architectures","first-page":"259","article-title":"A new matrix multiplication systolic array","author":"Quinton","year":"1986"},{"key":"10.1016\/0167-8191(89)90057-4_BIB20","series-title":"Algorithmes et Architectures Systoliques","author":"Quinton","year":"1989"},{"issue":"11","key":"10.1016\/0167-8191(89)90057-4_BIB21","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1109\/TC.1984.1676369","article-title":"Modular matrix multiplication on linear array","volume":"33","author":"Varman","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90057-4_BIB22","series-title":"Proc. ICPP","first-page":"376","article-title":"An optimal family of matrix multiplication algorithms on linear arrays","author":"Varman","year":"1985"},{"key":"10.1016\/0167-8191(89)90057-4_BIB23","series-title":"VLSI Systems and Computations","first-page":"226","article-title":"A wavefront notation tool for VLSI array design","author":"Weiser","year":"1981"},{"key":"10.1016\/0167-8191(89)90057-4_BIB24","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1109\/TC.1968.227420","article-title":"A new algorithm for inner product","volume":"17","author":"Winograd","year":"1968","journal-title":"IEEE Trans. Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900574?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900574?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:25:13Z","timestamp":1551068713000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819189900574"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,11]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,11]]}},"alternative-id":["0167819189900574"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(89)90057-4","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1989,11]]}}}