{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:30:27Z","timestamp":1757626227249,"version":"3.44.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":["Integration"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1016\/0167-9260(93)90003-u","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"25-50","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Assessing partitioning\/ scheduling\/storage trade-offs for regular iterative algorithms"],"prefix":"10.1016","volume":"15","author":[{"given":"Mark","family":"Anderson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francine","family":"Berman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0167-9260(93)90003-U_BIB1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MC.1982.1653825","article-title":"Why systolic architectures","volume":"25","author":"Kung","year":"1982","journal-title":"Computer"},{"key":"10.1016\/0167-9260(93)90003-U_BIB2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0167-8191(89)90053-7","article-title":"Synthesis of systolic algorithm design","volume":"12","author":"Guerra","year":"1989","journal-title":"Parallel Computing"},{"key":"10.1016\/0167-9260(93)90003-U_BIB3","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01558666","article-title":"Syntesizing systolic arrays with control signals from recurrence equations","volume":"3","author":"Rajopadhye","year":"1989","journal-title":"Distributed Computing"},{"key":"10.1016\/0167-9260(93)90003-U_BIB4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0167-8191(90)90105-I","article-title":"Synthesizing systolic arrays from recurrence equations","volume":"14","author":"Rajopadhye","year":"1990","journal-title":"Parallel Computing"},{"key":"10.1016\/0167-9260(93)90003-U_BIB5","first-page":"259","article-title":"Regular iterative algorithms and their implementation on processor arrays","volume":"76","author":"Rao","year":"1988"},{"key":"10.1016\/0167-9260(93)90003-U_BIB6","series-title":"The 2nd Annual ACM Symposium of Parallel Algorithms and Architectures","first-page":"367","article-title":"Study of parallelism in regular iterative algorithms","author":"Roychowdhury","year":"1990"},{"article-title":"Derivation, Extensions and parallel implementation of regular iterative algorithms","year":"1988","author":"Roychowdhury","key":"10.1016\/0167-9260(93)90003-U_BIB7"},{"key":"10.1016\/0167-9260(93)90003-U_BIB8","series-title":"International Conference on Application Specific Array Processors","first-page":"591","article-title":"A design methodology for fixed-size systolic arrays","author":"Bu","year":"1990"},{"key":"10.1016\/0167-9260(93)90003-U_BIB9","series-title":"Proceedings IEEE ICASP","first-page":"1217","article-title":"The partitioning problem on VLSI arrays: I\/O and local memory complexity","author":"Burleson","year":"1991"},{"key":"10.1016\/0167-9260(93)90003-U_BIB10","series-title":"Proceedings of the 1986 International Conference on Parallel Processing","first-page":"550","article-title":"A fixed size systolic array for arbitrarily large eigenvalue problems","author":"Chuang","year":"1985"},{"key":"10.1016\/0167-9260(93)90003-U_BIB11","series-title":"IEEE 1987 International Conference on Acoustic, Speech and Signal Processing","first-page":"764","article-title":"A design method of systolic arrays under the constraint of the number of processors","author":"Horiike","year":"1987"},{"year":"1988","series-title":"VLSI Array Processors","author":"Kung","key":"10.1016\/0167-9260(93)90003-U_BIB12"},{"issue":"1","key":"10.1016\/0167-9260(93)90003-U_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TC.1986.1676652","article-title":"Partitioning and mapping algorithms into fixed size systolic arrays","volume":"C-35","author":"Moldovan","year":"1986","journal-title":"IEEE Transactions on Computers"},{"article-title":"Matrix computations on mesh arrays","year":"1989","author":"Moreno","key":"10.1016\/0167-9260(93)90003-U_BIB14"},{"issue":"7","key":"10.1016\/0167-9260(93)90003-U_BIB15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/MC.1987.1663622","article-title":"Partitioning: An essential step in mapping algorithms into systolic arrays processors","volume":"20","author":"Navarro","year":"1987","journal-title":"Computer"},{"issue":"2","key":"10.1016\/0167-9260(93)90003-U_BIB16","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01602099","article-title":"Automatic design and partitioning of systolic\/wavefront arrays for VLSI","volume":"7","author":"Nelis","year":"1980","journal-title":"Circuits Systems Signal Process"},{"key":"10.1016\/0167-9260(93)90003-U_BIB17","series-title":"Proc. 25th Asilomar Conference","article-title":"Partitioning Considerations is systolic array design","author":"Kuchibhotla","year":"1991"},{"issue":"3","key":"10.1016\/0167-9260(93)90003-U_BIB18","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/321406.321418","article-title":"The organization of computations for uniform recurrence equations","volume":"14","author":"Karp","year":"1967","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/0167-9260(93)90003-U_BIB19","first-page":"19","article-title":"Matrix triangularization by systolic arrays","volume":"volume 298","author":"Gentleman","year":"1981"},{"key":"10.1016\/0167-9260(93)90003-U_BIB20","series-title":"1992 IEEE Workhop on VLSI Signal Processing","first-page":"342","article-title":"Orthogonal faddeev: From algorithm to parallel implementation","author":"den Heijer","year":"1992"},{"key":"10.1016\/0167-9260(93)90003-U_BIB21","doi-asserted-by":"crossref","unstructured":"M. Valero-Garcia, J.J. Navarro, J.M. Llaberia and M. Valero, Systematic design of two-level pipelined systolic arrays with data contraflow, in Proceedings of the ISCAS 1989, 2521\u20132525.","DOI":"10.1109\/ISCAS.1988.15455"},{"issue":"5","key":"10.1016\/0167-9260(93)90003-U_BIB22","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1137\/0219064","article-title":"Optimal size integer division circuits","volume":"19","author":"Reif","year":"1990","journal-title":"SIAM Journal of Computing"},{"issue":"8","key":"10.1016\/0167-9260(93)90003-U_BIB23","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1109\/43.31534","article-title":"Algorithms for hardware allocation in data path synthesis","volume":"7","author":"Devadas","year":"1989","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"10.1016\/0167-9260(93)90003-U_BIB24","series-title":"24th ACM\/IEEE Design Automation Conference","first-page":"35","article-title":"Prediction area-time tradeoffs for pipelined design","author":"Jain","year":"1987"},{"key":"10.1016\/0167-9260(93)90003-U_BIB25","first-page":"18","article-title":"Algorithms for high-level synthesis","author":"Pierre","year":"1989","journal-title":"IEEE Design and Test of Computers"},{"key":"10.1016\/0167-9260(93)90003-U_BIB26","series-title":"23th ACM\/IEEE Design Automation Conference","first-page":"461","article-title":"Maha: A program for data path synthesis","author":"Parker","year":"1986"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016792609390003U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016792609390003U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:37:24Z","timestamp":1757453844000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016792609390003U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["016792609390003U"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(93)90003-u","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1993,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Assessing partitioning\/ scheduling\/storage trade-offs for regular iterative algorithms","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(93)90003-U","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1993 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}