{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:56:07Z","timestamp":1755222967215,"version":"3.43.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"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":[[1998,5]]},"DOI":"10.1023\/a:1008008231304","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T07:45:23Z","timestamp":1040543123000},"page":"19-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Time Optimal Implementation of Uniform Recurrences onto Array Processors via Quadratic Programming"],"prefix":"10.1007","volume":"19","author":[{"given":"Karl-Heinz","family":"Zimmermann","sequence":"first","affiliation":[]},{"given":"Wolfgang","family":"Achtziger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1998,5,1]]},"reference":[{"key":"162428_CR1","volume-title":"Introduction to VLSI Systems","author":"C. Mead","year":"1980","unstructured":"C. Mead and L Conway, Introduction to VLSI Systems, Addison-Wesley, Reading, MA, 1980."},{"key":"162428_CR2","volume-title":"VLSI Array Processors","author":"S.Y. Kung","year":"1987","unstructured":"S.Y. Kung, VLSI Array Processors, Prentice Hall, Englewood Cliffs, NJ, 1987."},{"key":"162428_CR3","unstructured":"L. Guibas, H.T. Kung, and C.D. Thompson, \u201cDirect VLSI implementation of combinatorial algorithms,\u201d Proc. Conf. on Very Large Scale Integration: Architecture, Design and Fabrication, pp. 509-525, 1979."},{"key":"162428_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1109\/MC.1982.1653825","volume":"15","author":"H.T. Kung","year":"1982","unstructured":"H.T. Kung, \u201cWhy systolic architectures?,\u201d Computer, Vol. 15, pp. 37-46, 1982.","journal-title":"Computer"},{"key":"162428_CR5","unstructured":"H.T. Kung and C.E. Leiserson, \u201cSystolic arrays (for VLSI),\u201d in Sparse Matrix Proc., Soc. Ind. App. Math., Duff et al. (Eds.), pp. 256-282, 1979."},{"key":"162428_CR6","unstructured":"R.H Kuhn, \u201cTransforming algorithms for single-stage and VLSI architectures,\u201d Proc. Workshop Interconnection Networks Parallel Distributed Processing, IEEE CH1560-2, pp. 11-19, 1980."},{"issue":"11","key":"162428_CR7","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1109\/TC.1982.1675929","volume":"C-31","author":"D.I. Moldovan","year":"1982","unstructured":"D.I. Moldovan, \u201cOn the analysis and synthesis of VLSI algorithms,\u201d IEEE Transaction on Computers, Vol. C-31 No.11, pp. 1121-1126, 1982.","journal-title":"IEEE Transaction on Computers"},{"key":"162428_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF02253685","volume":"32","author":"W.L. Miranker","year":"1984","unstructured":"W.L. Miranker and A. Winkler, \u201cSpacetime representations of computational structures,\u201d Computing, Vol. 32, pp. 93-114, 1984.","journal-title":"Computing"},{"key":"162428_CR9","first-page":"23","volume":"2","author":"P.R. Cappello","year":"1984","unstructured":"P.R. Cappello and K. Steiglitz, \u201cUnifying VLSI designs with linear tranformations on space time,\u201d Adv. Comput. Res., Vol. 2, pp. 23-65, 1984.","journal-title":"Adv. Comput. Res."},{"key":"162428_CR10","unstructured":"Y. Wong and J.-M. Delosme, \u201cOptimal systolic implementation of n-dimensionale recurrences,\u201d IEEE Proc. ICCD, pp. 618-621, 1985."},{"key":"162428_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/TC.1985.1676516","volume":"C-34","author":"G. Lin","year":"1985","unstructured":"G. Lin and B.W. Wah, \u201cThe design of optimal systolic design,\u201d IEEE Trans. Comput., Vol. C-34, pp. 66-77, 1985.","journal-title":"IEEE Trans. Comput."},{"key":"162428_CR12","volume-title":"Regular iterative algorithms and their implementations on processor arrays","author":"S.K. Rao","year":"1985","unstructured":"S.K. Rao, \u201cRegular iterative algorithms and their implementations on processor arrays,\u201d Ph.D. Thesis, Stanford University, Stanford, CA, 1985."},{"key":"162428_CR13","unstructured":"J.A.B. Fortes, K.S. Fu, and B.W. Wah, \u201cSystematic approach to the design of algorithmically specified systolic arrays,\u201d Proc. ISCASSP, pp. 8.9.1-8.9.4, 1985."},{"key":"162428_CR14","unstructured":"J.-M. Delosme and I.C.F. Ipsen, \u201cSystolic array synthesis: Computability and time cones,\u201d in Parallel Algorithms and Architectures, M. Cosnard et al. (Eds.), North Holland, pp. 295-312, 1986."},{"key":"162428_CR15","first-page":"229","volume-title":"Automata Networks in Computer Science","author":"P. Quinton","year":"1987","unstructured":"P. Quinton, \u201cThe systematic design of systolic arrays,\u201d in Automata Networks in Computer Science, F. Folgelman-Soulie et al. (Eds.), Manchester University Press, Manchester, pp. 229- 260, 1987."},{"issue":"12","key":"162428_CR16","first-page":"1578","volume":"C-37","author":"P. Lee","year":"1988","unstructured":"P. Lee and Z.M. Kedem, \u201cSynthesizing linear array algorithms from nested for loop algorithms,\u201d IEEE Transaction on Computers, Vol. C-37 No.12, pp. 1578-1597, 1988.","journal-title":"IEEE Transaction on Computers"},{"key":"162428_CR17","unstructured":"W. Shang and Z.M. Fortes, \u201cTime optimal and conflict free mapping of uniform dependence algorithms into lower dimensional processor arrays,\u201d Int. Conference on Parallel Processing, pp. 101-110, 1990."},{"issue":"2","key":"162428_CR18","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1109\/12.123393","volume":"41","author":"Y. Wong","year":"1992","unstructured":"Y. Wong and J.-M. Delosme, \u201cOptimization of computation time for systolic arrays,\u201d IEEE Transactions on Computers, Vol. 41 No.2, pp. 159-177, 1992.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"162428_CR19","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/321406.321418","volume":"13","author":"R.M. Karp","year":"1967","unstructured":"R.M. Karp, R.E. Miller, and S. Winograd, \u201cThe organization of computations for uniform recurrence equations,\u201d Journal of the ACM, Vol. 13 No.3, pp. 563-590, July 1967.","journal-title":"Journal of the ACM"},{"key":"162428_CR20","doi-asserted-by":"crossref","unstructured":"L. Lamport, \u201cThe parallel execution of DO loops,\u201d Commun. ACM, pp. 83-93, 1974.","DOI":"10.1145\/360827.360844"},{"key":"162428_CR21","unstructured":"J. McCanny and J. McWhirter, \u201cThe derivation and utilization of bit level systolic array architectures,\u201d Proc. 1986 Int. Workshop Systolic Arrays, Oxford, England, pp. 47-59, 1986."},{"key":"162428_CR22","first-page":"178","volume-title":"Parallel Computers: Architecture, Programming and Algorithms","author":"R.W. Hockney","year":"1981","unstructured":"R.W. Hockney and C.R. Jesshope, Parallel Computers: Architecture, Programming and Algorithms, Adam Hilder Ltd., Bristol, pp. 178-192, 1981."},{"key":"162428_CR23","doi-asserted-by":"crossref","unstructured":"K.E. Batcher, \u201cBit-serial parallel processing systems,\u201d IEEE Trans. on Computers, Vol. C-31 No.5, pp. 377-384.","DOI":"10.1109\/TC.1982.1676015"},{"key":"162428_CR24","volume-title":"The Connection Machine","author":"W.D. Hillis","year":"1985","unstructured":"W.D. Hillis, The Connection Machine, MIT Press, Cambridge, MA, 1985."},{"key":"162428_CR25","doi-asserted-by":"crossref","unstructured":"M.T. O'Keefe and Z.M. Fortes, \u201cBit level processor array: Current architectures and a design and a programming tool,\u201d Int. Symposium on Circuit and System, Helsinki, Finland, pp. 2751- 2755, 1988.","DOI":"10.1109\/ISCAS.1988.15509"},{"key":"162428_CR26","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitrious","year":"1983","unstructured":"C.H. Papadimitrious and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, NJ, 1983."},{"key":"162428_CR27","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF00924526","volume":"12","author":"K.-H. Zimmermann","year":"1996","unstructured":"K.-H. Zimmermann, \u201cLinear mappings of n-dimensional uniform recurrences onto k-dimensional systolic arrays,\u201d J. of VLSI Signal Processing, Vol. 12, pp. 87-202, 1996.","journal-title":"J. of VLSI Signal Processing"},{"issue":"6","key":"162428_CR28","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1109\/12.90251","volume":"40","author":"W. Shang","year":"1991","unstructured":"W. Shang and J.A.B. Fortes, \u201cTime optimal linear schedules for algorithms with uniform dependencies,\u201d IEEE Transaction on Computers, Vol. 40 No.6, pp. 723-742, 1991.","journal-title":"IEEE Transaction on Computers"},{"key":"162428_CR29","doi-asserted-by":"crossref","unstructured":"A. Darte, L. Khachiyan, and Y. Robert, \u201cLinear scheduling is close to optimality,\u201d Int. Conf. on Application Specific Array Processors, IEEE Computer Soc. Press, pp. 37-46, 1992.","DOI":"10.1109\/ASAP.1992.218583"},{"key":"162428_CR30","unstructured":"J.A.B. Fortes and F. Parisi-Presicce, \u201cOptimal linear schedules for the parallel execution of algorithms,\u201d Int. Conf. on Parallel Processing, pp. 322-328, 1984."},{"key":"162428_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1077-8","volume-title":"Parallel Programming and Compilers","author":"C.D. Polychronopoulos","year":"1988","unstructured":"C.D. Polychronopoulos, Parallel Programming and Compilers, Kluwer, Boston, 1988."},{"issue":"5","key":"162428_CR32","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF01407835","volume":"21","author":"P. Feautrier","year":"1992","unstructured":"P. Feautrier, \u201cSome efficient solutions to the affine scheduling problem. I. One-dimensional time,\u201d Int. J. of Parallel Programming, Vol. 21 No.5, pp. 313-347, 1992.","journal-title":"Int. J. of Parallel Programming"},{"issue":"8","key":"162428_CR33","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, \u201cConstructive methods for scheduling uniform loop nests,\u201d IEEE Trans. on Parallel and Distributed Systems, Vol. 5 No.8, pp. 814-822, 1994.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"issue":"2","key":"162428_CR34","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 Transaction on Parallel and Distributed Systems, Vol. 5 No.2, pp. 193-205, 1994.","journal-title":"IEEE Transaction on Parallel and Distributed Systems"},{"key":"162428_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5676-0","volume-title":"Loop Parallelization","author":"U. Banerjee","year":"1994","unstructured":"U. Banerjee, Loop Parallelization, Kluwer, Boston, 1994."},{"key":"162428_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-62035-5","volume-title":"An Introduction to the Geometry of Numbers","author":"J.W.S. Cassels","year":"1959","unstructured":"J.W.S. Cassels, An Introduction to the Geometry of Numbers, Springer, Berlin, 1959."},{"key":"162428_CR37","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar, Convex Analysis, Princeton Univ. Press, Princeton, 1970."},{"key":"162428_CR38","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"M.S. Bazaraa","year":"1979","unstructured":"M.S. Bazaraa and C.M. Shetty, Nonlinear Programming: Theory and Algorithms, Wiley & Sons, New York, 1979."},{"key":"162428_CR39","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF00930641","volume":"4","author":"X. Zhong","year":"1992","unstructured":"X. Zhong, S. Rajopadhye, and I. Wong, \u201cSystematic generation of linear allocation functions in systolic array design,\u201d J. VLSI Signal Processing, Vol. 4, pp. 279-293, 1992.","journal-title":"J. VLSI Signal Processing"},{"key":"162428_CR40","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver, Theory of Linear and Integer Programming, Wiley & Sons, New York, 1986."},{"key":"162428_CR41","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0167-6377(88)90049-1","volume":"7","author":"P.M. Pardolos","year":"1988","unstructured":"P.M. Pardolos and G. Schnitger, \u201cChecking local optimality in constrained quadratic programming is NP-hard,\u201d Operations Research Letters, Vol. 7, pp. 33-35, 1988.","journal-title":"Operations Research Letters"},{"key":"162428_CR42","doi-asserted-by":"crossref","unstructured":"K. Schittkowski, \u201cNLPQL\u2013A FORTRAN subroutine solving constrained nonlinear programming problems,\u201d Annals of Operations Research, pp. 465-500, 1985-1986.","DOI":"10.1007\/BF02022087"},{"issue":"1","key":"162428_CR43","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, \u201cMapping nested loop algorithms into multidimensional systolic arrays,\u201d IEEE Trans. on Parallel and Distributed Systems, Vol. 1 No.1, pp. 64-76, 1990.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"162428_CR44","unstructured":"K.-H. Zimmermann and W. Achtziger, \u201cOn optimal piecewise linear schedules for LSGP-and LPGS-partitionings of array processors via quadratic programming,\u201d Techn. Report No. 202, Inst. of Appl. Math., University of Erlangen-Nuremberg, 1996."},{"key":"162428_CR45","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF00927836","volume":"3","author":"J. Teich","year":"1991","unstructured":"J. Teich and L. Thiele, \u201cControl generation in the design of processor arrays,\u201d J. of VLSI Signal Processing, Vol. 3, pp. 77-92, 1991.","journal-title":"J. of VLSI Signal Processing"},{"key":"162428_CR46","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1007963228049","volume":"15","author":"K.-H. Zimmermann","year":"1997","unstructured":"K.-H. Zimmermann and W. Achtziger, \u201cFinding space-time transformations for uniform recurrences via branching parametric linear programming,\u201d J. of VLSI Signal Processing, Vol. 15, pp. 259-274, 1997.","journal-title":"J. of VLSI Signal Processing"}],"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:1008008231304.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008008231304\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008008231304.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T09:27:31Z","timestamp":1754904451000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008008231304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["162428"],"URL":"https:\/\/doi.org\/10.1023\/a:1008008231304","relation":{},"ISSN":["0922-5773"],"issn-type":[{"type":"print","value":"0922-5773"}],"subject":[],"published":{"date-parts":[[1998,5]]},"assertion":[{"value":"1 May 1998","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}