{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T04:15:22Z","timestamp":1649132122483},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"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":[[1992,2]]},"DOI":"10.1016\/0167-8191(92)90077-k","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"185-194","source":"Crossref","is-referenced-by-count":7,"title":["Synthesis of size-optimal toro\u00efdal arrays for the Algebraic Path Problem: A new contribution"],"prefix":"10.1016","volume":"18","author":[{"given":"Ph","family":"Clauss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C","family":"Mongenet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.R","family":"Perrin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(92)90077-K_BIB1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0167-6423(90)90082-O","article-title":"Synthesis of a new systolic architecture for the Algebraic Path Problem","volume":"15","author":"Benaini","year":"1990","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-8191(92)90077-K_BIB2","series-title":"IEEE Internat. Conf. on Application Specific Array Processors, ASAP'90","article-title":"Spacetime-minimal systolic arrays for Gaussian Elimination and the Algebraic Path Problem","author":"Benaini","year":"1990"},{"key":"10.1016\/0167-8191(92)90077-K_BIB3","series-title":"Research Report 430","article-title":"Parallelization of Gauss elimination algorithm on systolic arrays","author":"Bermond","year":"1988"},{"key":"10.1016\/0167-8191(92)90077-K_BIB4","article-title":"Synth\u00e8se d'algorithms systoliques et implantation optimale en place sur r\u00e9seaux de processeurs synchrones","author":"Clauss","year":"1990"},{"key":"10.1016\/0167-8191(92)90077-K_BIB5","series-title":"CONPAR'88","article-title":"Synthesis of process arrays","author":"Clauss","year":"1988"},{"key":"10.1016\/0167-8191(92)90077-K_BIB6","series-title":"IEEE Internat. Conf. on Application Specific Array Processors, ASAP'90","article-title":"Calculus of space-optimal mappings of systolic algorithms on processor arrays","author":"Clauss","year":"1990"},{"key":"10.1016\/0167-8191(92)90077-K_BIB7","series-title":"Second Internat. Symp. on VSLI Technology, Systems and Applications","first-page":"268","article-title":"An illustration of a methodology for the construction of efficient systolic architectures in VLSI","author":"Delosme","year":"1985"},{"issue":"1","key":"10.1016\/0167-8191(92)90077-K_BIB8","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\/0167-8191(92)90077-K_BIB9","series-title":"Fifth Internat. Parallel Processing Symp.","article-title":"A geometrical coding to compile affine recurrence equations on regular arrays","author":"Mongenet","year":"1991"},{"issue":"1","key":"10.1016\/0167-8191(92)90077-K_BIB10","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","author":"Moldovan","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(92)90077-K_BIB11","first-page":"113","article-title":"On the design of algorithms for VLSI systolic arrays","volume":"71","author":"Moldovan","year":"1983"},{"key":"10.1016\/0167-8191(92)90077-K_BIB12","article-title":"Une m\u00e9thode de conception d'algorithmes systoliques, r\u00e9sultats th\u00e9oriques et r\u00e9alisation","author":"Mongenet","year":"1985"},{"key":"10.1016\/0167-8191(92)90077-K_BIB13","series-title":"Conf. Parallel Architectures and Languages Europe","article-title":"Affine timings for systems of affine recurrence equations","author":"Mongenet","year":"1991"},{"key":"10.1016\/0167-8191(92)90077-K_BIB14","series-title":"Conf. PARLE, LNCS 259","article-title":"Synthesis of systolic arrays for inductive problems","author":"Mongenet","year":"1987"},{"key":"10.1016\/0167-8191(92)90077-K_BIB15","series-title":"Proc. IEEE 11th Internat. 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\/0167-8191(92)90077-K_BIB16","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(92)90077-K_BIB17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02253318","article-title":"A systolic array algorithm for the Algebraic Path Problem","volume":"34","author":"Rote","year":"1985","journal-title":"Computing"},{"key":"10.1016\/0167-8191(92)90077-K_BIB18","series-title":"IEEE Internat. Conf. on Application Specific Array Processors, ASAP'90","article-title":"A processor-time minimal systolic array for transitive closure","author":"Scheiman","year":"1990"},{"issue":"10","key":"10.1016\/0167-8191(92)90077-K_BIB19","article-title":"M\u00e9thode de conception d'algorithmes parall\u00e8les pour r\u00e9seaux r\u00e9guliers","volume":"3","author":"Tchuente","year":"1989","journal-title":"Technique et Science Informatiques"},{"key":"10.1016\/0167-8191(92)90077-K_BIB20","article-title":"Optimization of processor count for systolic arrays","author":"Wong","year":"1989","journal-title":"Research Report YALEU\/DCS\/RR-697"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919290077K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919290077K?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:26:40Z","timestamp":1551068800000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919290077K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["016781919290077K"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(92)90077-k","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}