{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:33:41Z","timestamp":1772724821704,"version":"3.50.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[1985,5,1]],"date-time":"1985-05-01T00:00:00Z","timestamp":483753600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1985,5]]},"DOI":"10.1109\/tc.1985.1676584","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"448-461","source":"Crossref","is-referenced-by-count":205,"title":["Wafer-Scale Integration of Systolic Arrays"],"prefix":"10.1109","volume":"C-34","author":[{"family":"Leighton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Leiserson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","author":"rosenberger","year":"0"},{"key":"ref38","author":"rosenberg","year":"1982","journal-title":"On designing fault-tolerant arrays of processors"},{"key":"ref33","first-page":"95","article-title":"on the use of nonvolatile program links for restructurable vlsi","author":"raffel","year":"1979","journal-title":"Proc Caltech Conf VLSI"},{"key":"ref32","first-page":"21","author":"rabin","year":"1976","journal-title":"Algorithms and Complexity New Directions and Recent Results"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"ref30","author":"mead","year":"1980","journal-title":"Introduction to VLSI Systems"},{"key":"ref37","author":"rosenberg","year":"1982","journal-title":"The Diogenes approach to testable fault-tolerant networks of processors"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-68402-9_9"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322160"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.1985.1052320"},{"key":"ref28","doi-asserted-by":"crossref","DOI":"10.21236\/ADA012822","author":"manning","year":"1975","journal-title":"Automatic test configuration and repair of cellular arrays"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1147\/rd.252.0107"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1977.1674879"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/355921.355927"},{"key":"ref1","year":"0"},{"key":"ref20","author":"leighton","year":"1983","journal-title":"Complexity Issues in VLSI Optimal Layouts for the Shuffle-Exchange Graph and Other Networks"},{"key":"ref22","author":"leighton","year":"1982","journal-title":"Three-dimensional circuit layouts"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744433"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1980.13"},{"key":"ref23","author":"leighton","year":"0","journal-title":"SIAM J Comput"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/0136016"},{"key":"ref25","author":"leiserson","year":"1983","journal-title":"Area-efficient VLSI computation"},{"key":"ref10","article-title":"area and delay penalties for restructurable vlsi arrays","author":"greene","year":"0","journal-title":"J Ass Comput Mach"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0211003"},{"key":"ref40","first-page":"137","author":"sekanina","year":"1960","journal-title":"Pub Faculty of Sci"},{"key":"ref12","author":"hedlund","year":"0","journal-title":"Personal communication"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0211056"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1968-037-0"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2.3.209"},{"key":"ref16","article-title":"probabilistic analysis of multidimensional bin packing algorithms","author":"karp","year":"1983","journal-title":"Proc 16th ACM Symp Theory Comput"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.5009312"},{"key":"ref18","first-page":"256","article-title":"systolic arrays (for vlsi)","author":"kung","year":"1978","journal-title":"Sparse Matrix Proceedings 1978"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1961.5219222"},{"key":"ref4","first-page":"77","article-title":"how to assemble tree machines","author":"bhatt","year":"1982","journal-title":"Proc 14th ACM Symp Theory Comput"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90071-0"},{"key":"ref6","first-page":"17","article-title":"on the evolution of random graphs","volume":"5","author":"erdos","year":"1960","journal-title":"Magyar Tud Akad Math Kut Int Kozl"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-68402-9_10"},{"key":"ref8","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1067649.801727"},{"key":"ref49","author":"weide","year":"1978","journal-title":"Statistical methods in algorithm design and analysis"},{"key":"ref9","author":"greene","year":"1983","journal-title":"Configuration of VLSI arrays in the presence of defects"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804401"},{"key":"ref45","author":"spencer","year":"1982","journal-title":"Personal communication"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.6312176"},{"key":"ref47","author":"thompson","year":"1980","journal-title":"A Complexity Theory for VLSI"},{"key":"ref42","article-title":"the average case analysis of some on-line algorithms for bin packing","author":"shor","year":"1984","journal-title":"Proc 25th IEEE Conf Foundations Comput Sci"},{"key":"ref41","author":"shamos","year":"1978","journal-title":"Computational Geometry"},{"key":"ref44","first-page":"237","author":"snyder","year":"1981","journal-title":"VLSI 81"},{"key":"ref43","author":"siskind","year":"1981","journal-title":"private communication"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35245\/01676584.pdf?arnumber=1676584","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:40:14Z","timestamp":1638200414000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1676584\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,5]]},"references-count":49,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tc.1985.1676584","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[1985,5]]}}}