{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:20:03Z","timestamp":1750306803085,"version":"3.41.0"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2013,12,1]],"date-time":"2013-12-01T00:00:00Z","timestamp":1385856000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Israel Ministry of Science-Technology","award":["Mar-96"],"award-info":[{"award-number":["Mar-96"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2013,12]]},"abstract":"<jats:p>\n            Current high-level synthesis systems synthesize arithmetic units of a fixed known number of stages, and the scheduler mainly determines when units are activated. We focus on scheduling techniques for the high-level synthesis of pipelined arithmetic units where the number of stages of these operations is a free parameter of the synthesis. This problem is motivated by the ability to automatically create pipelined functional units, such as multipliers, with different pipe lengths. These units have different characteristics in terms of parallelism level, clock latency, frequency, etc. This article presents the Variable-length Pipeline Scheduler (VPS). The ability to synthesize variable-length pipelined units expands the known scheduling problem of high-level synthesis to include a search for a minimal number of hardware units (operations) and their desired number of stages. The proposed search procedure is based on algorithms that find a local minima in a\n            <jats:italic>d<\/jats:italic>\n            -dimensional grid, thus avoiding the need to evaluate all possible points in the space. We have implemented a C language compiler for VPS targeting FPGAs. Our results demonstrate that using variable-length pipeline units can reduce the overall resource usage and improve the execution time when synthesized onto an FPGA. The proposed search is sufficiently fast, taking only a few seconds, allowing an interactive mode of work. A comparison with xPilot shows a significant saving of hardware resources while maintaining comparable execution times of the resulting circuits. This work is an extension of a previous paper [Ben-Asher and Rotem 2008]\n          <\/jats:p>","DOI":"10.1145\/2539036.2539048","type":"journal-article","created":{"date-parts":[[2013,12,20]],"date-time":"2013-12-20T19:50:46Z","timestamp":1387569046000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["The benefits of using variable-length pipelined operations in high-level synthesis"],"prefix":"10.1145","volume":"13","author":[{"given":"Yosi","family":"Ben-Asher","sequence":"first","affiliation":[{"name":"University of Haifa"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadav","family":"Rotem","sequence":"additional","affiliation":[{"name":"University of Haifa"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,12,24]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993605"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI.2008.10"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/197405.197406"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPPW.2006.74"},{"volume-title":"Proceedings of the International Symposium on System-on-Chip (SOC'08)","author":"Ben-Asher Y.","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1878961.1878989"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.62794"},{"volume-title":"Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design (ICCAD'07)","author":"Chavet C.","key":"e_1_2_1_8_1"},{"volume-title":"Proceedings of the SRC TECHCON.","author":"Chen D.","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1344671.1344688"},{"key":"e_1_2_1_11_1","unstructured":"Devadas S. Ghosh A. and Keutzer K. 1994. Logic Synthesis. McGraw-Hill.   Devadas S. Ghosh A. and Keutzer K. 1994. Logic Synthesis. McGraw-Hill."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/CISP.2008.211"},{"key":"e_1_2_1_13_1","unstructured":"Gajski D. Dutt N. We A. and Lin S. 1994. High-Level Synthesis Introduction to Chip and System Design. Kluwer Academic Publishers.   Gajski D. Dutt N. We A. and Lin S. 1994. High-Level Synthesis Introduction to Chip and System Design. Kluwer Academic Publishers."},{"volume-title":"Proceedings of the 9th Great Lakes Symposium on VLSI. 140","author":"Ghosh A.","key":"e_1_2_1_14_1"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00454-4_5"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78610-8_30"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.75629"},{"volume-title":"Proceedings of the IEEE International Sympoisum on Circuits and Systems. IEEE, 1777--1780","author":"Ishikawa M.","key":"e_1_2_1_18_1"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.736132"},{"key":"e_1_2_1_20_1","unstructured":"Kleinberg J. and Tardos E. 2006. Algorithm Design. Addison-Wesley.   Kleinberg J. and Tardos E. 2006. Algorithm Design. Addison-Wesley."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1176254.1176321"},{"volume-title":"Proceedings of the Conference on Design, Automation and test in Europe (DATE'07)","author":"Kurra S.","key":"e_1_2_1_22_1"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/53990.54022"},{"key":"e_1_2_1_24_1","unstructured":"Lattner C. and Adve V. 2002. The LLVM instruction set and compilation strategy. Tech. rep. UIUCDCS-R-2002-2292 University of Illinois at Urbana-Champaign.  Lattner C. and Adve V. 2002. The LLVM instruction set and compilation strategy. Tech. rep. UIUCDCS-R-2002-2292 University of Illinois at Urbana-Champaign."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(89)90025-5"},{"volume-title":"Proceedings of the Conference on Parallel Architectures and Compilation Techniques (PACT'96)","year":"1996","author":"Llosa J.","key":"e_1_2_1_26_1"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.661250"},{"key":"e_1_2_1_28_1","unstructured":"Micheli G. D. 1994. Synthesis and Optimization of Digital Circuits. McGraw-Hill Higher Education.   Micheli G. D. 1994. Synthesis and Optimization of Digital Circuits. McGraw-Hill Higher Education."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1289881.1289882"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/62882.62954"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/37888.37918"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/192724.192731"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1669112.1669170"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/581630.581637"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/54.386007"},{"volume-title":"Proceedings of the Reconfigurable Architecture Workshop.","year":"1997","author":"Weinhardt M.","key":"e_1_2_1_36_1"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.908452"},{"volume-title":"Proceedings of the International Conference on Parallel Processing.","year":"1991","author":"Wolfe M.","key":"e_1_2_1_38_1"},{"volume-title":"Proceedings of the International Conference on Field Programmable Logic and Applications (FPL'09)","author":"Yosi B.-A.","key":"e_1_2_1_39_1"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2539036.2539048","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2539036.2539048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:50Z","timestamp":1750232090000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2539036.2539048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["10.1145\/2539036.2539048"],"URL":"https:\/\/doi.org\/10.1145\/2539036.2539048","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2013,12]]},"assertion":[{"value":"2011-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-12-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}