{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:29:30Z","timestamp":1748334570148},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1007\/bf01192158","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T11:53:58Z","timestamp":1108727638000},"page":"137-160","source":"Crossref","is-referenced-by-count":19,"title":["Geometrical tools to map systems of affine recurrence equations on regular arrays"],"prefix":"10.1007","volume":"31","author":[{"given":"Catherine","family":"Mongenet","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Clauss","sequence":"additional","affiliation":[]},{"given":"Guy-Ren\ufffd","family":"Perrin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"742","DOI":"10.2307\/2312260","volume":"7","author":"W.A. Blankinship","year":"1963","unstructured":"Blankinship, W.A.: A new version of the Euclidean algorithm. Am. Math. Mon.,7, 742?745 (1963)","journal-title":"Am. Math. Mon."},{"key":"CR2","unstructured":"Choo, Y., Chen, M.C.: A theory of program optimization. TR-608, University of Yale, 1988"},{"key":"CR3","volume-title":"Synth\u00e8se d'algorithmes systoliques et implantation optimale en place sur r\u00e9seaux de processeurs synchrones","author":"Ph. Clauss","year":"1990","unstructured":"Clauss, Ph.: Synth\u00e8se d'algorithmes systoliques et implantation optimale en place sur r\u00e9seaux de processeurs synchrones. PhD Thesis, University of Franche-Comt\u00e9, France, 1990"},{"key":"CR4","unstructured":"Clauss, Ph., Perrin, G.R.: Synthesis of process arrays. CONPAR'88. Manchester, G.B., 1988"},{"key":"CR5","volume-title":"Synthesis of efficient systolic arrays for matrix algebra problems. Int. Symp. on High Performance Computer Systems, Paris","author":"Ph. Clauss","year":"1987","unstructured":"Clauss, Ph., Mongenet, C., Perrin, G.R.: Synthesis of efficient systolic arrays for matrix algebra problems. Int. Symp. on High Performance Computer Systems, Paris. Amsterdam: North-Holland 1987"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Clauss, Ph., Mongenet, C., Perrin, G.R.: Calculus of space-optimal mappings of systolic algorithms on processor arrays. IEEE Int. Conf. on Application-Specific Array Processors, ASAP'90, Princeton, USA, pp. 4?18, 1990","DOI":"10.1109\/ASAP.1990.145438"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0167-8191(92)90077-K","volume":"18","author":"Ph. Clauss","year":"1992","unstructured":"Clauss, Ph., Mongenet, C., Perrin, G.R.: Synthesis of size-optimal toro\u00efdal arrays for the Algebraic Path Problem: a new contribution. Parallel Comput.18, 185?194 (1992)","journal-title":"Parallel Comput."},{"key":"CR8","series-title":"Research report 92-10","volume-title":"Scheduling uniform loop nests","author":"A. Darte","year":"1992","unstructured":"Darte, A., Robert, Y.: Scheduling uniform loop nests. Research report 92-10, LIP, ENS Lyon, 1992"},{"key":"CR9","unstructured":"Delosme, J.M., Ipsen, I.C.F.: An illustration of a methodology for the construction of efficient systolic architectures in VLSI. Sd. Int. Symposium on VSLI Technology, Systems and Applications, Taipei, Taiwan, R.O.C., pp. 268?273, 1985"},{"key":"CR10","volume-title":"Int. Workshop on Parallel and Distributed Algorithms","author":"J.M. Delosme","year":"1988","unstructured":"Delosme, J.M.: A parallel algorithm for the algebraic path problem. In: Cosnard, M., et al. (eds.) Int. Workshop on Parallel and Distributed Algorithms. Amsterdam: Elsevier 1988"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Fortes, J.A.B., Fu, K.S., Wah, B.W.: Systematic approaches to the design of algorithmically specified systolic arrays. Int. Conf. on Acoustics, Speech and Signal Processing, 1985","DOI":"10.1109\/ICASSP.1985.1168513"},{"key":"CR12","first-page":"297","volume-title":"Int. Workshop on Parallel and Distributed Algorithms","author":"F. Irigoin","year":"1989","unstructured":"Irigoin, F., Triolet, R.: Dependence approximation and global parallel code generation for nested loops. In: Cosnard, M., et al. (eds.) Int. Workshop on Parallel and Distributed Algorithms, pp. 297?308. Amsterdam: Elsevier 1989"},{"issue":"3","key":"CR13","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/321406.321418","volume":"14","author":"R.M. Karp","year":"1967","unstructured":"Karp, R.M., Miller, R.E., Winograd, S.: The organization of computations for uniform recurrence equations. J.ACM14 (3), 563?590 (1967)","journal-title":"J.ACM"},{"key":"CR14","unstructured":"Kung, H.T. Leiserson, C.E.: Systolic arrays of VLSI. Sparse Matrix Proc., SIAM, pp. 245?282, 1978"},{"issue":"1","key":"CR15","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MC.1982.1653825","volume":"15","author":"H.T. Kung","year":"1982","unstructured":"Kung, H.T.: Why systolic architectures? Computer15 (1), 37?46 (1982)","journal-title":"Computer"},{"issue":"5","key":"CR16","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/TC.1987.1676945","volume":"36","author":"S.Y. Kung","year":"1987","unstructured":"Kung, S.Y., Lo, S.C., Lewis, P.S.: Optimal systolic design for the transitive closure and the shortest path problem. IEEE Trans. Comput.C-36 (5), 603?614 (1987)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"CR17","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1109\/PROC.1983.12532","volume":"71","author":"D.I. Moldovan","year":"1983","unstructured":"Moldovan, D.I.: On the design of algorithms for VLSI systolic arrays. Proc IEEE Conf.71 (1), 113?120 (1983)","journal-title":"Proc IEEE Conf."},{"issue":"1","key":"CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TC.1986.1676652","volume":"35","author":"D.I. Moldovan","year":"1986","unstructured":"Moldovan, D.I., Fortes, J.A.B.: Partitioning and mapping algorithms into fixed size systolic arrays. IEEE Trans. Comput.35 (1), 1?12 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"CR19","volume-title":"Une m\u00e9thode de conception d'algorithmes systoliques, r\u00e9sultats th\u00e9oriques et r\u00e9alisation","author":"C. Mongenet","year":"1985","unstructured":"Mongenet, C.: Une m\u00e9thode de conception d'algorithmes systoliques, r\u00e9sultats th\u00e9oriques et r\u00e9alisation. PhD. Thesis, National Polytechnic Institute, Nancy, 1985"},{"key":"CR20","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/978-3-662-25209-3_17","volume-title":"Affine timings for systems of affine recurrence equations. Parallel architectures and languages europe, PARLE 91","author":"C. Mongenet","year":"1991","unstructured":"Mongenet, C.: Affine timings for systems of affine recurrence equations. Parallel architectures and languages europe, PARLE 91 (Lect. Notes Comput. Sci., vol. 505, pp. 236?251) Berlin, Heidelberg, New York: Springer 1991"},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"Mongenet, C., Clauss, Ph., Perrin, G.R.: Geometrical coding to compile affine recurrence equations on regular arrays. IEEE Int. Parallel Processing Symposium, Anaheim, California, 1991","DOI":"10.1109\/IPPS.1991.153840"},{"key":"CR22","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/3-540-17943-7_133","volume-title":"Synthesis of systolic arrays for inductive problems. Parallel architectures and languages Europe, PARLE 87","author":"C. Mongenet","year":"1987","unstructured":"Mongenet, C., Perrin, G.R.: Synthesis of systolic arrays for inductive problems. Parallel architectures and languages Europe, PARLE 87 (Lect. Notes Comput. Sci., vol. 259, pp. 260?277) Berlin, Heidelberg, New York: Springer 1987"},{"key":"CR23","volume-title":"Mapping programs on regular distributed architectures. Hypercube and distributed computers","author":"G.R. Perrin","year":"1989","unstructured":"Perrin, G.R., Clauss, Ph., Damy, S.: Mapping programs on regular distributed architectures. Hypercube and distributed computers. Amsterdam: Elsevier 1989"},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"Quinton, P.: Automatic synthesis of systolic arrays from uniform recurrence equations. Proc. IEEE 11th Int. Symp. on Computer Architecture, Ann Arbor, MI, USA, pp. 208?214, 1984","DOI":"10.1145\/773453.808184"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02477176","volume":"1","author":"P. Quinton","year":"1989","unstructured":"Quinton, P., Van Dongen, V.: The mapping of linear recurrence equations on regular arrays. J. VLSI Signal Process.1, 95?113 (1989)","journal-title":"J. VLSI Signal Process."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01558666","volume":"3","author":"S. Rajopadhye","year":"1989","unstructured":"Rajopadhye, S.: Synthesizing systolic arrays with control signals from recurrence equations. Distrib. Comput.3, 88?105 (1989)","journal-title":"Distrib. Comput."},{"key":"CR27","unstructured":"Rao, S.K.: Regular iterative algorithms and their implementation on processor arrays. Ph.D. Thesis, Information Systems Lab., Stanford University, 1985"},{"key":"CR28","unstructured":"Robert, Y., Trystram, D.: Systolic solution of the algebraic problem. Int. Workshop on Systolic Arrays, Oxford, Adam-Hilger pp. 171?180, 1987"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02253318","volume":"34","author":"G. Rote","year":"1985","unstructured":"Rote, G.: A systolic array algorithm for the algebraic path problem. Computing34, 191?219 (1985)","journal-title":"Computing"},{"key":"CR30","unstructured":"Roychowdhury, V., Thiele, L., Rao, S.K., Kailath, T.: On the localization of algorithms for VLSI processor arrays. IEEE, VLSI Signal Processing III, Monterey, CA, 1988"},{"key":"CR31","volume-title":"Computability of recurrence equations","author":"Y. Saouter","year":"1990","unstructured":"Saouter, Y., Quinton, P.: Computability of recurrence equations. TR-1203, IRISA, Rennes, 1990"},{"key":"CR32","volume-title":"Theory of linear and integer programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of linear and integer programming. New York: Wiley 1986"},{"key":"CR33","unstructured":"Wong, Y., Delosme, J.M.: Optimization of processor count for systolic arrays. Tech. Research Report, Yale University, Computer Science Department, 1989"},{"key":"CR34","doi-asserted-by":"crossref","unstructured":"Yaacobi, Y., Cappello, P.R.: Converting affine recurrence equations to quasi-uniform recurrence equations. Third Int. Workshop on Parallel Computation and VLSI Theory, pp. 373?382, 1988","DOI":"10.1007\/BFb0040399"},{"key":"CR35","doi-asserted-by":"crossref","unstructured":"Yaacobi, Y., Cappello, P.R.: Scheduling a system of affine recurrence equations onto a systolic array. Int. Conf. on Systolic Arrays, San Diego, USA, pp. 373?382, 1988","DOI":"10.1109\/ARRAYS.1988.18077"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/BF01192158.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/BF01192158\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/BF01192158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:56:01Z","timestamp":1586120161000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/10.1007\/BF01192158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["BF01192158"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/bf01192158","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}