{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:57:21Z","timestamp":1755223041236,"version":"3.43.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology"],"published-print":{"date-parts":[[1999,9]]},"DOI":"10.1023\/a:1008103504836","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:17:47Z","timestamp":1040545067000},"page":"151-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Space-Time Representation Method of Iterative Algorithms for the Design of Processor Arrays"],"prefix":"10.1007","volume":"22","author":[{"given":"E.D.","family":"Kyriakis-Bitzaros","sequence":"first","affiliation":[]},{"given":"C.E.","family":"Goutis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,9,1]]},"reference":[{"key":"237166_CR1","doi-asserted-by":"crossref","unstructured":"J. Bu and E.F. Deprettere, \"Analysis and modelling of sequential iterative algorithms for parallel and pipeline implementations,\" ISCAS, pp. 1961\u20131965, 1988.","DOI":"10.1109\/ISCAS.1988.15323"},{"key":"237166_CR2","first-page":"23","volume":"2","author":"P.R. Cappello","year":"1984","unstructured":"P.R. Cappello and K. Steiglitz, \"Unifying VLSI array design with linear transformations of space-time,\" Advances in Computer Research, JAI Press Inc., Vol. 2, pp 23\u201365, 1984.","journal-title":"Advances in Computer Research"},{"key":"237166_CR3","volume-title":"VLSI Array Processors","author":"S.Y. Kung","year":"1988","unstructured":"S.Y. Kung, VLSI Array Processors, Prentice Hall, New Jersey, 1988."},{"key":"237166_CR4","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/0743-7315(92)90037-N","volume":"16","author":"E.D. Kyriakis-Bitzaros","year":"1992","unstructured":"E.D. Kyriakis-Bitzaros and C.E. Goutis, \"An efficient decomposition technique for mapping nested loops with constant dependencies into regular processor arrays,\" J. of Parallel and Distributed Computing, Vol. 16, pp. 258\u2013264, 1992.","journal-title":"J. of Parallel and Distributed Computing"},{"key":"237166_CR5","doi-asserted-by":"publisher","first-page":"1578","DOI":"10.1109\/12.9735","volume":"37","author":"P. Lee","year":"1988","unstructured":"P. Lee and Z.M. Kedem, \"Synthesizing linear array algorithms from nested for loop algorithms,\" IEEE Trans. on Computers, Vol. 37, pp. 1578\u20131598, 1988.","journal-title":"IEEE Trans. on Computers"},{"key":"237166_CR6","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/71.80125","volume":"1","author":"P. Lee","year":"1990","unstructured":"P. Lee and Z.M. Kedem, \"Mapping nested loop algorithms into multidimensional systolic arrays,\" IEEE Trans. on Parallel and Distributed Systems, Vol. 1, pp. 64\u201376, 1990.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"237166_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TC.1986.1676652","volume":"C-35","author":"D.I. Moldovan","year":"1986","unstructured":"D.I. Moldovan and J.A.B. Fortes, \"Partitioning and mapping algorithms into fixed size systolic arrays,\" IEEE Trans. on Computers, Vol C-35, pp. 1\u201312, 1986.","journal-title":"IEEE Trans. on Computers"},{"key":"237166_CR8","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/2.55468","volume":"23","author":"J.H. Moreno","year":"1990","unstructured":"J.H. Moreno and T. Lang, \"Matrix computations on systolic type meshes,\" IEEE Computer, Vol. 23, pp. 32\u201351, 1990.","journal-title":"IEEE Computer"},{"key":"237166_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02477176","volume":"1","author":"P. Quinton","year":"1989","unstructured":"P. Quinton and V. Van Dongen, \"The mapping of linear recurrence equations on regular arrays,\" Journal of VLSI Signal Processing, Vol. 1, pp. 95\u2013113, 1989.","journal-title":"Journal of VLSI Signal Processing"},{"key":"237166_CR10","unstructured":"P. Quinton, \"The systematic design of systolic arrays,\" in Automata Networks in Computer Science, F. Fogelman, Y. Robert, and M. Tchuente <nt>(Eds.)<\/nt>, chap. 9, pp. 229\u2013260, 1987."},{"key":"237166_CR11","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01558666","volume":"3","author":"S.V. Rajopadhye","year":"1989","unstructured":"S.V. Rajopadhye, \"Synthesizing systolic arrays with control signals from recurrence equations,\" Distributed Computing, Vol. 3, pp. 88\u2013105, 1989.","journal-title":"Distributed Computing"},{"key":"237166_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/5.4402","volume":"76","author":"S.K. Rao","year":"1988","unstructured":"S.K. Rao and T. Kailath, \"Regular iterative algorithms and their implementation on processor arrays,\" Proc. of the IEEE, Vol. 76, pp. 259\u2013269, 1988.","journal-title":"Proc. of the IEEE"},{"key":"237166_CR13","unstructured":"V.P. Roychowdhury, S.K. Rao, L. Thiele, and T. Kailath, \"On the localization of algorithms for VLSI processor arrays,\" in VLSI Signal Processing III, R.W. Brodersen and H.S. Moscovitz <nt>(Eds.)<\/nt>, IEEE Press, pp 459\u2013470, 1988."},{"key":"237166_CR14","volume-title":"Systolic Design of Parameterized Recurrences","author":"V. Van Dongen","year":"1987","unstructured":"V. Van Dongen, \"Systolic Design of Parameterized Recurrences,\" W.D. 042, Philips Research Lab, Brussels, Jan. 1987."},{"key":"237166_CR15","doi-asserted-by":"crossref","unstructured":"Y. Yaacoby and R. Cappello, \"Scheduling a system of affine recurrence equations onto a systolic array,\" Proc. of the Int. Conf. on Systolic Arrays, pp. 373\u2013381, 1988.","DOI":"10.1109\/ARRAYS.1988.18077"},{"key":"237166_CR16","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1109\/71.298207","volume":"5","author":"A. Darte","year":"1994","unstructured":"A. Darte and Y. Robert, \"Constructive methods for scheduling uniform loop nests,\" IEEE Trans. on Parallel and Distributed Systems, Vol. 5, pp. 814\u2013822, 1994.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"237166_CR17","unstructured":"D.J. Kuck, The Structure of Computers and Computations, John Wiley & Sons, 1978."},{"key":"237166_CR18","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/12.30873","volume":"38","author":"J.K. Peir","year":"1989","unstructured":"J.K. Peir, and R. Cytron, \"Minimum distance: A method for partitioning recurrences for multiprocessors,\" IEEE Trans. on Computers, Vol. 38, 1989, pp. 1203\u20131211.","journal-title":"IEEE Trans. on Computers"},{"key":"237166_CR19","doi-asserted-by":"crossref","unstructured":"C.D. Polychronopoulos, Parallel Programming and Compilers, Kluwer Academic Publishers, 1988.","DOI":"10.1007\/978-1-4613-1077-8"},{"key":"237166_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/71.277789","volume":"5","author":"A. Rogers","year":"1994","unstructured":"A. Rogers and K. Pingali, \"Compiling for distributed memory architectures,\" IEEE Trans. on Parallel and Distributed Systems, Vol. 5, pp. 281\u2013298, 1994.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"237166_CR21","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/71.265946","volume":"5","author":"W. Shang","year":"1994","unstructured":"W. Shang, M.T. O'Keefe and, J.A.B. Fortes, \u201cOn loop transformations for generalized cycle shrinking,\u201d IEEE Trans. on Parallel and Distributed Systems, Vol. 5, pp. 193\u2013204, 199","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"237166_CR22","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1109\/71.97902","volume":"2","author":"M.E. Wolf","year":"1991","unstructured":"M.E. Wolf and M.S. Lam, \"A loop transformation theory and an algorithm to maximize parallelism,\" IEEE Trans. on Parallel and Distributed Systems, Vol. 2, pp. 452\u2013471, 1991.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"237166_CR23","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/321406.321418","volume":"14","author":"R. Karp","year":"1967","unstructured":"R. Karp, R.E. Miller, and S. Winograd, \"The organization of computations for uniform recurrence equations,\" Journal of the ACM, Vol. 14, pp. 563\u2013590, 1967.","journal-title":"Journal of the ACM"},{"key":"237166_CR24","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/360827.360844","volume":"17","author":"L. Lamport","year":"1974","unstructured":"L. Lamport, \"The parallel execution of DO loops,\" Communications of the ACM, Vol. 17, pp. 83\u201393, 1974.","journal-title":"Communications of the ACM"},{"key":"237166_CR25","unstructured":"J.A.B. Fortes, K.S. Fu, and B.W. Wah, \"Systematic design approaches for algorithmically specified systolic arrays,\" in Computer Architecture, V. Milutinovic <nt>(Ed.)<\/nt>, North Holland, pp. 454\u2013494, 1988."},{"key":"237166_CR26","doi-asserted-by":"crossref","unstructured":"Y.Wong and J.M. Delosme, \"Broadcast removal in systolic algorithms,\" Proc. of the Int. Conf. on Systolic Arrays, pp. 403\u2013412, 1989.","DOI":"10.1109\/ARRAYS.1988.18080"},{"key":"237166_CR27","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1109\/TC.1987.1676945","volume":"C-36","author":"S.Y. Kung","year":"1987","unstructured":"S.Y. Kung, S.C. Lo, and P.S. Lewis, \"Optimal systolic design for the transitive closure and the shortest path problems,\" IEEE Trans. on Computers, Vol. C-36, pp. 603\u2013614, 1987.","journal-title":"IEEE Trans. on Computers"},{"key":"237166_CR28","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/71.139200","volume":"3","author":"C.J. Scheiman","year":"1992","unstructured":"C.J. Scheiman and P.R. Cappello, \"A processor-time-minimal systolic array for transitive closure,\" IEEE Trans. on Parallel and Distributed Systems, Vol. 3, pp. 257\u2013269, 1992.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"237166_CR29","first-page":"2","volume":"3","author":"E.D. Kyriakis-Bitzaros","year":"1993","unstructured":"E.D. Kyriakis-Bitzaros, O.G. Koufopavlou, and C.E. Goutis, \"Space-time representation of iterative algorithms and the design of regular\/processor arrays,\" Proc. of the ICPP, Vol. 3, pp. 2\u20139, 1993.","journal-title":"Proc. of the ICPP"},{"key":"237166_CR30","volume-title":"Linear Programming","author":"G. Hadley","year":"1962","unstructured":"G. Hadley, Linear Programming, AddisonWiley, Reading, MA, 1962."}],"container-title":["Journal of VLSI signal processing systems for signal, image and video technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008103504836.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008103504836\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008103504836.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T09:49:35Z","timestamp":1754905775000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008103504836"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["237166"],"URL":"https:\/\/doi.org\/10.1023\/a:1008103504836","relation":{},"ISSN":["0922-5773"],"issn-type":[{"type":"print","value":"0922-5773"}],"subject":[],"published":{"date-parts":[[1999,9]]},"assertion":[{"value":"1 September 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}