{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T10:03:26Z","timestamp":1649153006510},"reference-count":31,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7382,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1993,5]]},"DOI":"10.1016\/s0747-7171(06)80005-2","type":"journal-article","created":{"date-parts":[[2007,4,25]],"date-time":"2007-04-25T18:20:47Z","timestamp":1177525247000},"page":"547-569","source":"Crossref","is-referenced-by-count":3,"title":["Synthesis aspects in the design of efficient processor arrays from affine recurrence equations"],"prefix":"10.1016","volume":"15","author":[{"given":"Philippe","family":"Clauss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catherine","family":"Mongenet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(06)80005-2_bib1","doi-asserted-by":"crossref","first-page":"742","DOI":"10.2307\/2312260","article-title":"A New Version of the Eucliean Algorithm","author":"Blankinship","year":"1963","journal-title":"American Mathematical Monthly"},{"key":"10.1016\/S0747-7171(06)80005-2_bib2","series-title":"International Conference on Application-Specific Array Processors, ASAP'90","first-page":"591","article-title":"A design methodology for fixed-size systolic arrays","author":"Bu","year":"1990"},{"key":"10.1016\/S0747-7171(06)80005-2_bib3","article-title":"Synth\u00e8se d'algorithmes systoliques et implantation optimale en place sur r\u00e9seaux de processeurs synchrones","author":"Clauss","year":"1990","journal-title":"PhD Thesis, University of Franche-Comt\u00e9, France"},{"key":"10.1016\/S0747-7171(06)80005-2_bib4","series-title":"International Conference on Application-Specific Array Processors, ASAP'90,","first-page":"4","article-title":"Calculus of Space-Optimal Mappings of Systolic Algorithms on Processor Arrays","author":"Clauss","year":"1990"},{"key":"10.1016\/S0747-7171(06)80005-2_bib5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0167-9260(91)90026-H","article-title":"Regular partitioning for synthesizing fixed-size systolic arrays","volume":"12","author":"Darte","year":"1991","journal-title":"Integration, the VLSI journal"},{"key":"10.1016\/S0747-7171(06)80005-2_bib6","series-title":"Sd. Int. Symposium on VSLI Technology","first-page":"268","article-title":"An Illustration of a Methodology for the construction of Efficient Systolic Architectures in VLSI","author":"Delosme","year":"1985"},{"key":"10.1016\/S0747-7171(06)80005-2_bib7","series-title":"Int. Conf. on Acoustics, Speech and Signal Processing","article-title":"Systematic Approaches to the Design of Algorithmically Specified Systolic Arrays","author":"Fortes","year":"1985"},{"key":"10.1016\/S0747-7171(06)80005-2_bib8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/321406.321418","article-title":"The Organization of Computations for Uniform Recurrence Equations","volume":"14","author":"Karp","year":"1967","journal-title":"JACM"},{"key":"10.1016\/S0747-7171(06)80005-2_bib9","series-title":"VLSI Array Processors","author":"Kung","year":"1988"},{"key":"10.1016\/S0747-7171(06)80005-2_bib10","series-title":"Int. Parallel Processing Symposium","article-title":"Geometrical Coding to Compile Affine Recurrence Equations on Regular Arrays","author":"Mongenet","year":"1991"},{"key":"10.1016\/S0747-7171(06)80005-2_bib11","doi-asserted-by":"crossref","DOI":"10.1007\/BF01192158","article-title":"Geometrical Tools to Map Systems of Affine Recurrence Equations on Regular Arrays","author":"Mongenet","year":"1991"},{"key":"10.1016\/S0747-7171(06)80005-2_bib12","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":"35-1","author":"Moldovan","year":"1986","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0747-7171(06)80005-2_bib13","first-page":"113","article-title":"On the Design of Algorithms for VLSI Systolic Arrays","volume":"71-1","author":"Moldovan","year":"1983"},{"key":"10.1016\/S0747-7171(06)80005-2_bib14","article-title":"Une M\u00e9thode de Conception d'Algorithmes Systoliques, R\u00e9sultats Th\u00e9oriques et r\u00e9alisation","author":"Mongenet","year":"1985","journal-title":"PhD. Thesis, National Polytechnic Institute, Nancy"},{"key":"10.1016\/S0747-7171(06)80005-2_bib15","series-title":"Parallel Architectures and Languages Europe Conf.","article-title":"Affine Timings for Systems of Affine Recurrence Equations","author":"Mongenet","year":"1991"},{"key":"10.1016\/S0747-7171(06)80005-2_bib16","series-title":"Parallel Architectures and Languages Europe Conf.","article-title":"Synthesis of Systolic Arrays for Inductive Problems","author":"Mongenet","year":"1987"},{"key":"10.1016\/S0747-7171(06)80005-2_bib17","series-title":"Phoenix Conference on Computers ans Communications","first-page":"39","article-title":"Synthesis of Heterogeneous Systolic Arrays","author":"Mongenet","year":"1988"},{"key":"10.1016\/S0747-7171(06)80005-2_bib18","doi-asserted-by":"crossref","DOI":"10.1109\/MC.1987.1663622","article-title":"Partitioning:an essential step in mapping algorithms into systolic array processors","author":"Navarro","year":"1987","journal-title":"IEEE Computer"},{"key":"10.1016\/S0747-7171(06)80005-2_bib19","series-title":"11th Int. Symp. on Computer Architecture","first-page":"208","article-title":"Automatic Synthesis of Systolic Arrays from Uniform Recurrence Equations","author":"Quinton","year":"1984"},{"key":"10.1016\/S0747-7171(06)80005-2_bib20","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02477176","article-title":"The Mapping of Linear Recurrence Equation on Regular Arrays","volume":"1","author":"Quinton","year":"1989","journal-title":"The Journal of VLSI Signal Processing"},{"key":"10.1016\/S0747-7171(06)80005-2_bib21","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01558666","article-title":"Synthesizing Systolic Arrays with Control Signals from Recurrence Equations","author":"Rajopadhye","year":"1989","journal-title":"Distributed Computing"},{"key":"10.1016\/S0747-7171(06)80005-2_bib22","article-title":"Regular Iterative Algorithms and their Implementation on Processor Arrays","author":"Rao","year":"1985","journal-title":"Ph.D. Thesis, Information Systems Lab., Stanford University"},{"key":"10.1016\/S0747-7171(06)80005-2_bib23","first-page":"259","article-title":"Regular Iterative Algorithms and their Implementation on Processor Arrays","volume":"76","author":"Rao","year":"1988"},{"key":"10.1016\/S0747-7171(06)80005-2_bib24","first-page":"459","article-title":"On the localization of algorithms for VLSI processor arrays","author":"Roychowdhury","year":"1988"},{"key":"10.1016\/S0747-7171(06)80005-2_bib25","series-title":"Computability of Recurrence Equations","author":"Saouter","year":"1990"},{"key":"10.1016\/S0747-7171(06)80005-2_bib26","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0747-7171(06)80005-2_bib27","series-title":"International Conference on Application Specific Array Processors, ASAP'92","first-page":"4","article-title":"A transformative approach to the partitioning of processor arrays","author":"Teich","year":"1992"},{"key":"10.1016\/S0747-7171(06)80005-2_bib28","series-title":"Int. Conference on systolic arrays","article-title":"Broadcast removal in systolic algorithms","author":"Wong","year":"1988"},{"key":"10.1016\/S0747-7171(06)80005-2_bib29","series-title":"Third Int. Workshop on Parallel Computation and VLSI Theory","first-page":"373","article-title":"Converting Affine Recurrence Equations to Quasi-Uniform Recurrence Equations","author":"Yaacobi","year":"1988"},{"key":"10.1016\/S0747-7171(06)80005-2_bib30","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02477177","article-title":"Scheduling a System of Nonsingular Affine Recurrence Equations onto a Processor Array","volume":"1","author":"Yaacobi","year":"1989","journal-title":"Journal of VLSI Signal Processing"},{"key":"10.1016\/S0747-7171(06)80005-2_bib31","series-title":"Parallel Architectures and Languages Europe, PARLE 91, LNCS 505, Springer Verlag Ed.","article-title":"Deriving fully efficient systolic arrays by quasi-linear allocation functions","author":"Zhong","year":"1991"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717106800052?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717106800052?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,8]],"date-time":"2019-01-08T00:53:18Z","timestamp":1546908798000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717106800052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":31,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["S0747717106800052"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(06)80005-2","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}