{"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":1751053493073},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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,1]]},"DOI":"10.1016\/0167-8191(93)90104-s","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"33-61","source":"Crossref","is-referenced-by-count":6,"title":["A methodology for algorithm regularization and mapping into time-optimal VLSI arrays"],"prefix":"10.1016","volume":"19","author":[{"given":"H","family":"Barada","sequence":"first","affiliation":[]},{"given":"A","family":"El-Amawy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(93)90104-S_BIB1","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":"Comput."},{"key":"10.1016\/0167-8191(93)90104-S_BIB2","series-title":"Proc. ICCD","first-page":"300","article-title":"Systematic approaches to the design of algorithmically specified systolic arrays","author":"Fortes","year":"1985"},{"key":"10.1016\/0167-8191(93)90104-S_BIB3","series-title":"VLSI Array Processors","author":"Kung","year":"1988"},{"key":"10.1016\/0167-8191(93)90104-S_BIB4","article-title":"Regular iterative algorithms and their implementation on processor arrays","author":"Rao","year":"1985"},{"key":"10.1016\/0167-8191(93)90104-S_BIB5","series-title":"Proc. Conf. Elliptic Problem Solvers","article-title":"An algebra for VLSI algorithm design","author":"Kung","year":"1983"},{"key":"10.1016\/0167-8191(93)90104-S_BIB6","series-title":"Proc. ICASSP","first-page":"851","article-title":"Design framework for systolic type arrays","author":"Jover","year":"1984"},{"key":"10.1016\/0167-8191(93)90104-S_BIB7","first-page":"66","article-title":"The design of optimal systolic arrays","volume":"1","author":"Li","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90104-S_BIB8","series-title":"Proc. 8th Internat Conf. Pattern Recognition","article-title":"Space-time domain expansion approach to VLSI and its application to hierarchical scene matching","author":"Cheng","year":"1984"},{"key":"10.1016\/0167-8191(93)90104-S_BIB9","series-title":"Proc. IFIP 6th Internat. Symp. on Computer Hardware Description Lang. Appl.","article-title":"A transformational model of VLSI systolic design","author":"Lam","year":"1983"},{"key":"10.1016\/0167-8191(93)90104-S_BIB10","series-title":"Proc. Internat Conf. on Parallel Processing","first-page":"448","article-title":"Unifying VLSI array designs with geometric transformations","author":"Cappello","year":"1983"},{"key":"10.1016\/0167-8191(93)90104-S_BIB11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02477176","article-title":"The mapping of linear recurrence equations on regular arrays","volume":"1","author":"Quinton","year":"1989","journal-title":"J. VLSI Signal Processing"},{"key":"10.1016\/0167-8191(93)90104-S_BIB12","article-title":"Optimization and interconnection complexity for parallel processors, single stage networks and decision trees","author":"Khun","year":"1980"},{"issue":"11","key":"10.1016\/0167-8191(93)90104-S_BIB13","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1109\/TC.1982.1675929","article-title":"On the analysis and synthesis of VLSI algorithms","volume":"C-31","author":"Moldovan","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90104-S_BIB14","article-title":"Algorithm transformations for parallel processing and VLSI architecture design","author":"Fortes","year":"1983"},{"key":"10.1016\/0167-8191(93)90104-S_BIB15","article-title":"Design of algorithm transformations for VLSI array processing","author":"Dorairaj","year":"1987"},{"issue":"1","key":"10.1016\/0167-8191(93)90104-S_BIB16","article-title":"Nonplanar switchable arrays","volume":"7","author":"Aravena","year":"1988","journal-title":"Circuits Systems Signal Processing"},{"key":"10.1016\/0167-8191(93)90104-S_BIB17","first-page":"149","article-title":"Array architecture for iterative matrix calculations","volume":"134","author":"El-Amawy","year":"1987"},{"issue":"5","key":"10.1016\/0167-8191(93)90104-S_BIB18","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1049\/el:19870542","article-title":"Improving the performance of nonplanar systolic architectures through increased fan-out","volume":"23","author":"El-Amawy","year":"1987","journal-title":"Electron. Letters"},{"key":"10.1016\/0167-8191(93)90104-S_BIB19","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1109\/TC.1979.1675434","article-title":"Time and parallel processor bounds for Fortran-like loops","volume":"C-28","author":"Barnergee","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90104-S_BIB20","series-title":"20th Asilomar Conf.","first-page":"518","article-title":"Fast LU-decomposition of dense matrices on an optimal array","author":"El-Amawy","year":"1986"},{"issue":"3","key":"10.1016\/0167-8191(93)90104-S_BIB21","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1109\/12.21131","article-title":"A systolic architecture for fast dense matrix inversion","volume":"38","author":"El-Amawy","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90104-S_BIB22","article-title":"A comprehensive methodology for algorithm characterization, regularization and mapping into optimal VLSI arrays","author":"Barada","year":"1989"},{"key":"10.1016\/0167-8191(93)90104-S_BIB23","series-title":"Proc. 3rd Parallel Processing Symp.","article-title":"A new methodology for mapping algorithms into VLSI arrays","author":"Barada","year":"1989"},{"key":"10.1016\/0167-8191(93)90104-S_BIB24","series-title":"Internat Conf. on Systolic Arrays","first-page":"472","article-title":"Uniformization of linear recurrence equations: a step toward the automatic synthesis of systolic arrays","author":"Dongen","year":"1988"},{"issue":"5","key":"10.1016\/0167-8191(93)90104-S_BIB25","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/TC.1987.1676945","article-title":"Optimal systolic design for the transitive closure and the shortest path problem","volume":"C36","author":"Kung","year":"1987","journal-title":"IEEE Trans. Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390104S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390104S?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:27:31Z","timestamp":1551068851000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919390104S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["016781919390104S"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(93)90104-s","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}