{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T13:44:50Z","timestamp":1698068690224},"reference-count":20,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":6087,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1990,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>An experiment of a mechanical code generation for a programmable systolic computer is reported. Two\u2010dimensional systolic arrays are automatically reduced to one dimension, and code is generated for the one\u2010dimensional processor array Warp. The technique is demonstrated with two examples: matrix multiplication and LU decomposition.<\/jats:p>","DOI":"10.1002\/spe.4380200304","type":"journal-article","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T05:15:41Z","timestamp":1163826941000},"page":"261-282","source":"Crossref","is-referenced-by-count":3,"title":["Code generation for a systolic computer"],"prefix":"10.1002","volume":"20","author":[{"given":"Christian","family":"Lengauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Introduction to VLSI Systems","author":"Kung H. T.","year":"1980"},{"key":"e_1_2_1_3_2","unstructured":"S. K.Rao \u2018Regular iterative algorithms and their implementations on processor arrays\u2019 Ph. D. Thesis Department of Electrical Engineering Stanford University October1985."},{"key":"e_1_2_1_4_2","first-page":"93","volume-title":"VLSI Signal Processing II","author":"Frison P.","year":"1986"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00282618"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.5009502"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321996"},{"key":"e_1_2_1_8_2","unstructured":"1988 Carnegie\u2010Mellon University T. Gross M. Lam J. Reinders Programming Warp in W2 Department of Computer Science"},{"key":"e_1_2_1_9_2","unstructured":"C.\u2010H.Huang \u2018The mechanically certified derivation of concurrency and its application to systolic design\u2019 Ph. D. Thesis Department of Computer Sciences The University of Texas at Austin August1987."},{"key":"e_1_2_1_10_2","unstructured":"P.Quinton \u2018The systematic design of systolic arrays\u2019 Tech. Report 193 Publication Interne IRISA April 1983; also: TR84\u201311 The Microelectronics Center of North Carolina May1984."},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51285-3_45"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51305-1_18"},{"issue":"12","key":"e_1_2_1_13_2","doi-asserted-by":"crossref","first-page":"1578","DOI":"10.1109\/12.9735","article-title":"\u2018Synthesizing linear array algorithms from nested for loop algorithms\u2019","volume":"37","author":"Lee P.","year":"1988","journal-title":"IEEE Trans. Computers"},{"key":"e_1_2_1_14_2","volume-title":"Proc. Hardware Specification, Verification and Synthesis: Mathematical Aspects","author":"Lengauer C.","year":"1989"},{"key":"e_1_2_1_15_2","first-page":"307","volume-title":"VLSI and Computers (CompEuro 87)","author":"Huang C.\u2010H.","year":"1987"},{"key":"e_1_2_1_16_2","unstructured":"C.Lengauer \u2018On the projection problem in systolic design\u2019 Tech. Report CMU\u2010CS\u201088\u2013102 Computer Science Department Carnegie\u2010Mellon University February1988."},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676652"},{"key":"e_1_2_1_18_2","unstructured":"D. G.HudsonandC.Lengauer \u2018A systolic program for Gauss\u2014Jordan elimination\u2019 Tech. Report TR\u201089\u201307 Department of Computer Sciences The University of Texas at Austin March1989."},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(89)90018-X"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(86)90010-9"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1987.1270243"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380200304","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380200304","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T10:50:15Z","timestamp":1697971815000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380200304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["10.1002\/spe.4380200304"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380200304","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}