{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:10:32Z","timestamp":1757542232244},"reference-count":35,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1986,7,1]],"date-time":"1986-07-01T00:00:00Z","timestamp":520560000000},"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":[[1986,7]]},"DOI":"10.1016\/0167-8191(86)90021-9","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T05:16:13Z","timestamp":1063343773000},"page":"217-229","source":"Crossref","is-referenced-by-count":7,"title":["The mapping of 2-D array processors to 1-D array processors"],"prefix":"10.1016","volume":"3","author":[{"given":"C.B.","family":"Yang","sequence":"first","affiliation":[]},{"given":"R.C.T.","family":"Lee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0167-8191(86)90021-9_BIB1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1109\/TC.1984.1676442","article-title":"Systolic algorithms for string manipulations","volume":"33","author":"Apostolico","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(86)90021-9_BIB2","series-title":"Dynamic Programming","author":"Bellman","year":"1957"},{"issue":"8","key":"10.1016\/0167-8191(86)90021-9_BIB3","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1109\/TC.1984.5009358","article-title":"Systolic VLSI arrays for polynomial GCD computation","volume":"33","author":"Brent","year":"1984","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"10.1016\/0167-8191(86)90021-9_BIB4","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1109\/TC.1984.1676494","article-title":"Computational geometry on a systolic chip","volume":"33","author":"Chazelle","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(86)90021-9_BIB5","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/MC.1980.1653418","article-title":"Data flow supercomputers","author":"Dennis","year":"1980","journal-title":"IEEE Comput."},{"key":"10.1016\/0167-8191(86)90021-9_BIB6","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/MC.1980.1653338","article-title":"The design of special-purpose VLSI chips","author":"Foster","year":"1980","journal-title":"IEEE Comput."},{"key":"10.1016\/0167-8191(86)90021-9_BIB7","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/MC.1982.1653942","article-title":"A second opinion on data flow machines and languages","author":"Gajski","year":"1982","journal-title":"IEEE Comput."},{"issue":"10","key":"10.1016\/0167-8191(86)90021-9_BIB8","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1109\/TC.1980.1675474","article-title":"Performance of a simulated dataflow computer","volume":"29","author":"Gostelow","year":"1980","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0167-8191(86)90021-9_BIB9","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1145\/322033.322044","article-title":"Algorithms for the longest common subsequence problem","volume":"24","author":"Hirschberg","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0167-8191(86)90021-9_BIB10","series-title":"Parallel Computers","author":"Hockney","year":"1981"},{"key":"10.1016\/0167-8191(86)90021-9_BIB11","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1978"},{"key":"10.1016\/0167-8191(86)90021-9_BIB12","article-title":"New algorithms for the longest common subsequence problems","author":"Hsu","year":"1983"},{"key":"10.1016\/0167-8191(86)90021-9_BIB13","series-title":"Computer Architecture and Parallel Processing","author":"Hwang","year":"1984"},{"issue":"10","key":"10.1016\/0167-8191(86)90021-9_BIB14","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/TC.1982.1675909","article-title":"Systolic processing and implementation for signal and image","volume":"31","author":"Kulkarni","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(86)90021-9_BIB15","series-title":"Parallel Processing System","first-page":"339","article-title":"Notes on VLSI computation","author":"Kung","year":"1982"},{"key":"10.1016\/0167-8191(86)90021-9_BIB16","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MC.1982.1653825","article-title":"Why systolic architectures?","author":"Kung","year":"1982","journal-title":"IEEE Comput."},{"issue":"11","key":"10.1016\/0167-8191(86)90021-9_BIB17","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1109\/TC.1982.1675922","article-title":"Wavefront array processor: Language, architecture, and applications","volume":"31","author":"Kung","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(86)90021-9_BIB18","article-title":"Clustering analysis and its applications","volume":"Vol. 8","author":"Lee","year":"1981"},{"key":"10.1016\/0167-8191(86)90021-9_BIB19","first-page":"632","article-title":"Optimised bit level systolic array for convolution","volume":"131","author":"McCanng","year":"1984"},{"key":"10.1016\/0167-8191(86)90021-9_BIB20","series-title":"Introduction to VLSI Systems","author":"Mead","year":"1980"},{"issue":"11","key":"10.1016\/0167-8191(86)90021-9_BIB21","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1109\/TC.1982.1675929","article-title":"On the analysis and synthesis of VLSI algorithms","volume":"31","author":"Moldovan","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(86)90021-9_BIB22","first-page":"113","article-title":"On the design of algorithms for VLSI systolic arrays","volume":"71","author":"Moldovan","year":"1983"},{"issue":"2","key":"10.1016\/0167-8191(86)90021-9_BIB23","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1109\/TC.1977.5009292","article-title":"A data flow multiprocessor","volume":"26","author":"Rumbaugh","year":"1977","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0167-8191(86)90021-9_BIB24","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/TASSP.1978.1163055","article-title":"Dynamic programming algorithm optimization for spoken word recognition","volume":"26","author":"Sakoe","year":"1978","journal-title":"IEEE Trans. Acoust. Speech. Signal Processing"},{"issue":"6","key":"10.1016\/0167-8191(86)90021-9_BIB25","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1109\/TASSP.1979.1163310","article-title":"two-level DP-matching\u2014A dynamic programming-based pattern matching algorithm for connected word recognition","volume":"27","author":"Sakoe","year":"1979","journal-title":"IEEE Trans. Acoust. Speech Signal Processing"},{"issue":"1","key":"10.1016\/0167-8191(86)90021-9_BIB26","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/TC.1984.5009318","article-title":"A systolic design for connectivity problems","volume":"33","author":"Savage","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(86)90021-9_BIB27","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0097-3165(74)90050-8","article-title":"An algorithm for the distance between two finite sequences","volume":"16","author":"Sellers","year":"1974","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0167-8191(86)90021-9_BIB28","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0304-3975(83)90146-9","article-title":"Systolic trees and systolic language recognition by tree automata","volume":"22","author":"Steinby","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-8191(86)90021-9_BIB29","series-title":"Computational Aspects of VLSI","author":"Ullman","year":"1984"},{"key":"10.1016\/0167-8191(86)90021-9_BIB30","first-page":"623","article-title":"Systolic matrix and vector multiplication methods for signal processing","volume":"131","author":"Urquhart","year":"1984"},{"issue":"1","key":"10.1016\/0167-8191(86)90021-9_BIB31","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","article-title":"The string-to-string correction problem","volume":"21","author":"Wagner","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0167-8191(86)90021-9_BIB32","first-page":"638","article-title":"Application of a systolic array to adaptive beamforming","volume":"131","author":"Ward","year":"1984"},{"issue":"8","key":"10.1016\/0167-8191(86)90021-9_BIB33","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1109\/TC.1983.1676311","article-title":"Dynamic time warp pattern matching using an integrated multiprocessing array","volume":"32","author":"Weste","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(86)90021-9_BIB34","series-title":"Proc. International Computer Symposium 1984","first-page":"895","article-title":"Systolic algorithms for the LCS problem","author":"Yang","year":"1984"},{"issue":"4","key":"10.1016\/0167-8191(86)90021-9_BIB35","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1109\/TC.1984.1676441","article-title":"Systolic multipliers for finite field GF(2m)","volume":"33","author":"Yeh","year":"1984","journal-title":"IEEE Trans. Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819186900219?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819186900219?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,3]],"date-time":"2018-12-03T21:50:48Z","timestamp":1543873848000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819186900219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,7]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,7]]}},"alternative-id":["0167819186900219"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(86)90021-9","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1986,7]]}}}