{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:15:46Z","timestamp":1770992146362,"version":"3.50.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,8,1]],"date-time":"1985-08-01T00:00:00Z","timestamp":491702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1985,8,1]],"date-time":"1985-08-01T00:00:00Z","timestamp":491702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1985,8]]},"DOI":"10.1016\/0743-7315(85)90029-2","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"277-301","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":60,"title":["Parallelism detection and transformation techniques useful for VLSI algorithms"],"prefix":"10.1016","volume":"2","author":[{"given":"J.A.B.","family":"Fortes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.I.","family":"Moldovan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0743-7315(85)90029-2_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":"Computer"},{"key":"10.1016\/0743-7315(85)90029-2_BIB2","series-title":"Introduction to VLSI Systems","article-title":"Algorithms for VLSI processor arrays","author":"Kung","year":"1980"},{"issue":"11","key":"10.1016\/0743-7315(85)90029-2_BIB3","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1109\/TC.1982.1675922","article-title":"Wavefront array processor: Language architecture and applications","volume":"C-31","author":"Kung","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(85)90029-2_BIB4","series-title":"Proc. Caltech Conf. on VLSI","article-title":"Towards a formal treatment of VLSI arrays","author":"Johnsson","year":"1981"},{"issue":"12","key":"10.1016\/0743-7315(85)90029-2_BIB5","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1109\/TC.1982.1675945","article-title":"Partitioned matrix algorithms for VLSI arithmetic systems","volume":"C-31","author":"Hwang","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(85)90029-2_BIB6","series-title":"Proc. Int. Conf. on Parallel Processing","first-page":"217","article-title":"VLSI computing structure for solving large scale linear systems of equations","author":"Hwang","year":"1980"},{"key":"10.1016\/0743-7315(85)90029-2_BIB7","series-title":"VLSI Systems and Computations","first-page":"255","article-title":"A two-level pipelined systolic array for convolutions","author":"Kung","year":"1981"},{"key":"10.1016\/0743-7315(85)90029-2_BIB8","series-title":"VLSI Systems and Computations","first-page":"273","article-title":"Systolic array processor developments","author":"Bromley","year":"1981"},{"key":"10.1016\/0743-7315(85)90029-2_BIB9","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":"Computer"},{"key":"10.1016\/0743-7315(85)90029-2_BIB10","series-title":"Proc. 9th Annual Symp. Computer Architecture","article-title":"VLSI architecture for high speed recognition of general context free languages and finite state languages","author":"Chu","year":"1982"},{"issue":"10","key":"10.1016\/0743-7315(85)90029-2_BIB11","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/TC.1982.1675909","article-title":"Systolic processing and an implementation for signal and image processing","volume":"C-31","author":"Kulkarni","year":"1982","journal-title":"IEEE Trans. Comput."},{"issue":"11","key":"10.1016\/0743-7315(85)90029-2_BIB12","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\/0743-7315(85)90029-2_BIB13","first-page":"113","article-title":"On the design of algorithms for VLSI systolic arrays","volume":"71","author":"Moldovan","year":"1983"},{"key":"10.1016\/0743-7315(85)90029-2_BIB14","series-title":"CMU Conf. on VLSI Systems and Comp.","first-page":"226","article-title":"A mathematical approach to modelling the flow of data and control in computational networks","author":"Johnsson","year":"1981"},{"key":"10.1016\/0743-7315(85)90029-2_BIB15","unstructured":"Cappello, P. R., and Steiglitz, K. Unifying VLSI array designs with geometric transformations. Proc. 1983 Conf. on Parallel Processing, pp. 448\u2013457."},{"key":"10.1016\/0743-7315(85)90029-2_BIB16","series-title":"Proc. COMPSAC","first-page":"310","article-title":"The design of optimal systolic algorithms","author":"Li","year":"1983"},{"key":"10.1016\/0743-7315(85)90029-2_BIB17","article-title":"Optimization and interconnection complexity for parallel processors, single stage networks and decision trees","author":"Kuhn","year":"1980"},{"issue":"9","key":"10.1016\/0743-7315(85)90029-2_BIB18","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":"Banerjee","year":"1979","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"10.1016\/0743-7315(85)90029-2_BIB19","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1109\/TC.1980.1675676","article-title":"High-speed multiprocessors and compilation techniques","volume":"C-29","author":"Padua","year":"1980","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/0743-7315(85)90029-2_BIB20","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/360827.360844","article-title":"The parallel execution of DO-loops","volume":"17","author":"Lamport","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-7315(85)90029-2_BIB21","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/TC.1982.1675890","article-title":"Improved time and parallel processor bounds for FORTRAN-like loops","volume":"C-31","author":"Heuft","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(85)90029-2_BIB22","first-page":"30","article-title":"The Diophantine Equations","author":"Mordell","year":"1969"},{"key":"10.1016\/0743-7315(85)90029-2_BIB23","article-title":"Algorithm transformations for parallel processing and VLSI architecture design","author":"Fortes","year":"1983"},{"key":"10.1016\/0743-7315(85)90029-2_BIB24","series-title":"Universal Algebra","author":"Cohn","year":"1965"},{"key":"10.1016\/0743-7315(85)90029-2_BIB25","series-title":"Categories for the Working Mathematician","author":"MacLane","year":"1971"},{"issue":"1","key":"10.1016\/0743-7315(85)90029-2_BIB26","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/MC.1982.1653826","article-title":"Introduction to the configurable highly parallel computer","volume":"15","author":"Synder","year":"1982","journal-title":"IEEE Comput."},{"key":"10.1016\/0743-7315(85)90029-2_BIB27","series-title":"Computer Arrays and Networks: Algorithm-Structured Parallel Architectures","author":"Uhr","year":"1982"},{"key":"10.1016\/0743-7315(85)90029-2_BIB28","series-title":"Proc. 13th Int. Conf. on Parallel Processing","article-title":"Optimal linear schedules for the parallel execution of algorithms","author":"Fortes","year":"1984"},{"key":"10.1016\/0743-7315(85)90029-2_BIB29","doi-asserted-by":"crossref","unstructured":"Fortes, J. A. B., and Moldovan, D. I., Data broadcasting in linearly scheduled array processors.Proc. 1984 Symp. in Computer Architecture.","DOI":"10.1145\/800015.808186"},{"key":"10.1016\/0743-7315(85)90029-2_BIB30","first-page":"83","article-title":"Partitioning algorithms for fixed size VLSI architectures","author":"Moldovan","year":"1983"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731585900292?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731585900292?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:29:13Z","timestamp":1757514553000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731585900292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,8]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,8]]}},"alternative-id":["0743731585900292"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(85)90029-2","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[1985,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parallelism detection and transformation techniques useful for VLSI algorithms","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(85)90029-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1985 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}