{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:43:27Z","timestamp":1742913807074,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030576622"},{"type":"electronic","value":"9783030576639"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-57663-9_25","type":"book-chapter","created":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T12:15:06Z","timestamp":1597148106000},"page":"386-400","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Development of the Compiler from C to the Processor with FPGA Accelerator"],"prefix":"10.1007","author":[{"given":"Anton","family":"Baglij","sequence":"first","affiliation":[]},{"given":"Elena","family":"Metelitsa","sequence":"additional","affiliation":[]},{"given":"Yury","family":"Mikhailuts","sequence":"additional","affiliation":[]},{"given":"Ruslan","family":"Ibragimov","sequence":"additional","affiliation":[]},{"given":"Boris","family":"Steinberg","sequence":"additional","affiliation":[]},{"given":"Oleg","family":"Steinberg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,12]]},"reference":[{"key":"25_CR1","unstructured":"Preliminary Product Specification\/XILINX\/Zynq-7000 All Programmable SoC Overview (2018). http:\/\/www.xilinx.com\/support\/documentation\/data_sheets\/ds190-Zynq-7000-Overview.pdf. Accessed 21 July 2019"},{"key":"25_CR2","doi-asserted-by":"publisher","unstructured":"Steinberg, B.Y., Dubrov, D.V., Mikhailuts, Y., Roshal, A.S., Steinberg, R.B.: Automatic high-level programs mapping onto programmable architectures. In: Malyshkin, V. (ed.) PaCT 2015. LNCS, vol. 9251, pp. 474\u2013485. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21909-7_46. ISBN 978-3-319-21909-7","DOI":"10.1007\/978-3-319-21909-7_46"},{"key":"25_CR3","unstructured":"Bondalapati, K.K.: Modeling and mapping for dynamically reconfigurable hybrid architectures. Ph.D. thesis. University of Southern California, California (2001)"},{"key":"25_CR4","unstructured":"Kalyaev, A., Levin, I.: Modulno-narashchivaemye mnogoprotsessornye sistemy so strukturno-protsedurnoi organizatsiei vychislenii. (Russian) [Modularly multiprocessor systems with structurally-procedural organization of computations]. \u201cIanus-K\u201d, p. 380 (2003)"},{"key":"25_CR5","unstructured":"Korneev, V.: Arkhitektura vychislitelnykh sistem s programmiruemoi strukturoi. (Russian) [Programmable Computer Architecture]. Nauka, Novosibirsk (1985)"},{"key":"25_CR6","unstructured":"Kalyaev, I., Levin, I.: Rekonfiguriruemye multikonveiernye vychislitelnye struktury. (Russian) [Reconfigurable multi-pipeline computing structures] ed. by I. Kaliaeva, Izdatelstvo IuNTs RAN, Rostov-n\/D, p. 344 (2009)"},{"key":"25_CR7","unstructured":"Yadzhak, M.: Vysokoparallelnye algoritmy i metody dlia resheniia zadach massovykh arifmeticheskikh i logicheskikh vychislenii. (Russian) [Highly parallel algorithms and methods for solving problems of mass arithmetic and logical calculations]: Ph.D. thesis, Yadzhak, M.S. Institut prikladnykh problem mekhaniki i matematiki, Lvov (2001)"},{"key":"25_CR8","unstructured":"Samofalov, K., Lutskii, G.: Osnovy teorii mnogourovnevykh konveiernykh vychislitelnykh sistem. (Russian) [Fundamentals of the theory of multidimensional conveyor computing systems]. Radio i sviaz, Moskva, p. 272 (1989)"},{"key":"25_CR9","doi-asserted-by":"publisher","unstructured":"Yosi, B.-A., Nadav, R., Eddie, S.: Finding the best compromise in compiling compound loops to Verilog. J. Syst. Arch. 56(9), 474\u2013486 (2010). https:\/\/doi.org\/10.1016\/j.sysarc.2010.07.001. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1383762110000688. ISSN 1383\u20137621","DOI":"10.1016\/j.sysarc.2010.07.001"},{"key":"25_CR10","doi-asserted-by":"publisher","unstructured":"Esko, O., et al.: Customized exposed datapath soft-core design flow with compiler support. In: 2010 International Conference on Field Programmable Logic and Applications, pp. 217\u2013222 (2010). https:\/\/doi.org\/10.1109\/FPL.2010.51","DOI":"10.1109\/FPL.2010.51"},{"key":"25_CR11","unstructured":"Polyakov, G., Lysykh, V.: A formal method of functional SNS-synthesis of problem-oriented parallel-pipelined devices. In: Proceedings of the National Supercomputer Forum (NSCF-2013). Pereslavl-Zalessky, Russia (2013)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Cardoso, J., Diniz, P.: Compilation Techniques for Recongurable Architectures (2009)","DOI":"10.1007\/978-0-387-09671-1"},{"key":"25_CR13","doi-asserted-by":"publisher","unstructured":"Tripp, J.L., Gokhale, M., Peterson, K.: Trident: from high-level language to hardware circuitry. Computer 40(3), 28\u201337 (2007). https:\/\/doi.org\/10.1109\/MC.2007.107. ISSN 0018-9162","DOI":"10.1109\/MC.2007.107"},{"key":"25_CR14","doi-asserted-by":"publisher","unstructured":"Kindratenko, V.V., Brunner, R.J., Myers, A.D.: Mitrion-C application development on SGI Altix 350\/RC100. In: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM 2007, pp. 239\u2013250. IEEE Computer Society, Washington, DC (2007). https:\/\/doi.org\/10.1109\/FCCM.2007.45. ISBN 0-7695-2940-2","DOI":"10.1109\/FCCM.2007.45"},{"key":"25_CR15","doi-asserted-by":"publisher","unstructured":"Self, R.P., Fleury, M., Downton, A.C.: Design methodology for construction of asynchronous pipelines with Handel-C. IEE Proc. Softw. 150(1), 39\u201347 (2003). https:\/\/doi.org\/10.1049\/ip-sen:20030206. ISSN 1462-5970","DOI":"10.1049\/ip-sen:20030206"},{"key":"25_CR16","doi-asserted-by":"publisher","unstructured":"Boulytchev, D., Medvedev, O.: Hardware description language based on message passing and implicit pipelining. In: 2010 East-West Design Test Symposium (EWDTS), pp. 438\u2013441 (2010). https:\/\/doi.org\/10.1109\/EWDTS.2010.5742095","DOI":"10.1109\/EWDTS.2010.5742095"},{"key":"25_CR17","doi-asserted-by":"publisher","unstructured":"Zhang, J., et al.: Bit-level optimization for high-level synthesis and FPGA-based acceleration. In: Proceedings of the 18th Annual ACM\/SIGDA International Symposium on Field Programmable Gate Arrays, FPGA 2010, pp. 59\u201368. ACM, Monterey (2010). https:\/\/doi.org\/10.1145\/1723112.1723124. http:\/\/doi.acm.org\/10.1145\/1723112.1723124. ISBN 978-1-60558-911-4","DOI":"10.1145\/1723112.1723124"},{"key":"25_CR18","unstructured":"Lacis, A., Dbar, S.: Sistema programmirovaniia Avtokod HDL i opyt ee primeneniia dlia skhemnoi realizatsii chislennykh metodov v FPGA. (Russian) [Programming system Autocode HDL and experience of its application for circuit implementation of numerical methods in FPGA], Nauchnyi servis v seti Internet: masshtabiruemost, parallelnost, effektivnost: Trudy Vserossiiskoi nauchnoi konferentsii (21\u201326 sentiabria 2009 g., g. Novorossiisk). Izd-vo MGU, p. 237 (2009)"},{"key":"25_CR19","doi-asserted-by":"publisher","unstructured":"Dubrov, D., Roshal, A.: Generating pipeline integrated circuits using C2HDL converter. In: East-West Design Test Symposium (EWDTS 2013), pp. 1\u20134 (2013). https:\/\/doi.org\/10.1109\/EWDTS.2013.6673108","DOI":"10.1109\/EWDTS.2013.6673108"},{"key":"25_CR20","unstructured":"Dubrov, D., Roshal, A.: Avtomaticheskoe otobrazhenie programm na protsessor s PLIS-uskoritelem. (Russian) [Automatic mapping of programs on a processor with FPGA accelerator], Vestnik Iuzhno-uralskogo gosudarstvennogo universiteta. Seriia \u201cVychislitelnaia matematika i informatika\u201d, vol. 3, no. 2, pp. 117\u2013121 (2014)"},{"key":"25_CR21","doi-asserted-by":"publisher","unstructured":"Steinberg, B.Y., et al.: A project of compiler for a processor with programmable accelerator. Procedia. Comput. Sci. 101(1), 435\u2013438 (2016). https:\/\/doi.org\/10.1016\/j.procs.2016.11.050. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1877050916327193","DOI":"10.1016\/j.procs.2016.11.050"},{"key":"25_CR22","doi-asserted-by":"publisher","unstructured":"Steinberg, B.Y., et al.: Developing a high-level language compiler for a computer with programmable architecture. In: Proceedings of the 12th Central and Eastern European Software Engineering Conference in Russia on - CEE-SECR 2016, pp. 1\u20136. ACM Press, New York (2016). https:\/\/doi.org\/10.1145\/3022211.3022226. http:\/\/dl.acm.org\/citation.cfm?doid=3022211.3022226. ISBN 9781450348843","DOI":"10.1145\/3022211.3022226"},{"key":"25_CR23","doi-asserted-by":"publisher","unstructured":"Steinberg, B.Y., et al.: Classification of loops with one statement for executing on the processor with programmable accelerator. Prog. Syst. Theory Appl. 8(3), 189\u2013218 (2017). https:\/\/doi.org\/10.25209\/2079-3316-2017-8-3-189-218. ISSN 2079-3316","DOI":"10.25209\/2079-3316-2017-8-3-189-218"},{"key":"25_CR24","unstructured":"Optimizing parallelization system (2013). www.ops.rsu.ru. Accessed 21 July 2019"},{"key":"25_CR25","doi-asserted-by":"publisher","unstructured":"Gervich, L.R., et al.: How OPS (optimizing parallelizing system) may be useful for clang. In: ACM International Conference Proceeding Series Association for Computing Machinery (2017). https:\/\/doi.org\/10.1145\/3166094.3166116. ISBN 9781450363969","DOI":"10.1145\/3166094.3166116"},{"key":"25_CR26","doi-asserted-by":"publisher","unstructured":"Alymova, E.V.: On the intermediate program representation for automatic generation of pipeline compute units. University News. North-Caucasian Region. Technical Sciences Series, no. 3, pp. 22\u201328 (2017). https:\/\/doi.org\/10.17213\/0321-2653-2017-3-22-28. ISSN 03212653","DOI":"10.17213\/0321-2653-2017-3-22-28"},{"key":"25_CR27","doi-asserted-by":"publisher","unstructured":"Steinberg, B.Y., et al.: Pipeline circuits to compute several expressions. In: Proceedings of the 14th Central and Eastern European Software Engineering Conference Russia on ZZZ - CEE-SECR 2018, pp. 1\u20137. ACM Press, New York (2018). https:\/\/doi.org\/10.1145\/3290621.3290632. http:\/\/dl.acm.org\/citation.cfm?doid=3290621.3290632. ISBN 9781450361767","DOI":"10.1145\/3290621.3290632"},{"key":"25_CR28","unstructured":"Mikhajluts, J., et al:. Drajvery dlja obespechenija vzaimodejstvija uskoritelja s rekonfiguriruemoj arhitekturoj i central\u2019nogo processora vychislitel\u2019noj sistemy. (Russian) [Drivers for the interaction of the accelerator with the reconfigurable architecture and the central processor of the computing system]. Jazyki programmirovanija i kompiljatory. Trudy Vserossijskoj nauchnoj konferencii pamjati A.L. Fuksmana. Publishing house of the southern federal university, Rostov-on-Don,, pp. 205\u2013208 (2017)"},{"key":"25_CR29","unstructured":"Steinberg, R.: Vychislenie zaderzhki v startakh konveierov dlia superkompiuterov so strukturno protsedurnoi organizatsiei vychislenii. (Russian) [Calculation of delay in pipeline starts for supercomputers with structurally procedural organization of calculations]. Iskusstvennyi intellekt. Nauchnoteoreticheskii zhurnal, no. 4, pp. 105\u2013112 (2003)"},{"key":"25_CR30","unstructured":"Steinberg, R.: Ispolzovanie reshetchatykh grafov dlia issledovaniia mnogokonveiernoi modeli vychislenii. (Russian) [The Use of Lattice Graphs to Research the Multi-Pipeline Computation Model]. Izvestiia VUZov. Severokavkazskii region. Estestvennye nauki, no. 2, pp. 16\u201318 (2009)"},{"key":"25_CR31","unstructured":"Steinberg, R.: Otobrazhenie gnezd tsiklov na mnogokonveiernuiu arkhitekturu. (Russian) [Mapping Loop Nests to a Multi-Pipeline Architecture] Programmirovanie 36(3), 177\u2013185 (2010)"},{"key":"25_CR32","doi-asserted-by":"crossref","unstructured":"Steinberg, O.B.: Circular shift of loop body-programme transformation, promoting Parallelism. Vestnik Iuzhno-Uralskogo gosudarstvennogo universiteta. Seriia: Matematicheskoe modelirovanie i programmirovanie 10(3) (2017)","DOI":"10.14529\/mmp170310"},{"key":"25_CR33","unstructured":"Steinberg, O.B., Ivlev, I.A.: Primenenie preobrazovaniia tsiklov \u201cRetiming\u201d s tseliu umensheniia kolichestva ispolzuemykh registrov. (Russian) [Using \u201cRetiming\u201d loop transformation to reduce the number of registers used]. Izvestiia vysshikh uchebnykh zavedenii. Severo-Kavkazskii region. Tekhnicheskie nauki. 3(195) (2017)"},{"key":"25_CR34","unstructured":"Steinberg, B.: Blochno-affinnye razmeshcheniia dannykh v parallelnoi pamiati. (Russian) [Block-affine Parallel Memory Locations]. Informatsionnye tekhnologii, no. 6, pp. 36\u201341 (2010). https:\/\/elibrary.ru\/item.asp?id=14998775. ISSN 1684\u20136400"},{"issue":"3","key":"25_CR35","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/TPDS.2011.171","volume":"23","author":"D Liu","year":"2012","unstructured":"Liu, D., et al.: Optimally maximizing iteration-level loop parallelism. IEEE Trans. Parallel Distrib. Syst. 23(3), 564\u2013572 (2012)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Software Engineering Education"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57663-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T09:15:57Z","timestamp":1617700557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-57663-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030576622","9783030576639"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57663-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"12 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FISEE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Software Engineering Education","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Villebrumier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fisee2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.laser-foundation.org\/fisee\/fisee-2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"96% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Papers were invited; 3 papers stem from an associated TOOLS Workshop: Artificial and Natural Tools (ANT)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}