{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:23:08Z","timestamp":1774628588789,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030293994","type":"print"},{"value":"9783030294007","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29400-7_13","type":"book-chapter","created":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T23:02:41Z","timestamp":1566169361000},"page":"170-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Design-Space Exploration with Multi-Objective Resource-Aware Modulo Scheduling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8073-720X","authenticated-orcid":false,"given":"Julian","family":"Oppermann","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2896-3709","authenticated-orcid":false,"given":"Patrick","family":"Sittel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8593-3138","authenticated-orcid":false,"given":"Martin","family":"Kumm","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2231-7749","authenticated-orcid":false,"given":"Melanie","family":"Reuter-Oppermann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1164-3082","authenticated-orcid":false,"given":"Andreas","family":"Koch","sequence":"additional","affiliation":[]},{"given":"Oliver","family":"Sinnen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"key":"13_CR1","unstructured":"HatScheT - Project Website (2019). http:\/\/www.uni-kassel.de\/go\/hatschet"},{"key":"13_CR2","unstructured":"Origami HLS - Project Website (2019). http:\/\/www.uni-kassel.de\/go\/origami"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Canis, A., Brown, S.D., Anderson, J.H.: Modulo SDC scheduling with recurrence minimization in high-level synthesis. In: 24th International Conference on Field Programmable Logic and Applications (2014)","DOI":"10.1109\/FPL.2014.6927490"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Chen, F., et al.: Enabling FPGAs in the Cloud. In: Proceedings of the 11th ACM Conference on Computing Frontiers (2014)","DOI":"10.1145\/2597917.2597929"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/5.558708","volume":"85","author":"G De Michell","year":"1997","unstructured":"De Michell, G., Gupta, R.K.: Hardware\/software co-design. Proc. IEEE 85, 3 (1997)","journal-title":"Proc. IEEE"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/3-540-27659-9","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization, 2nd edn, p. 323. Springer, Berlin (2005). https:\/\/doi.org\/10.1007\/3-540-27659-9","edition":"2"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Eichenberger, A.E., Davidson, E.S.: Efficient formulation for optimal modulo schedulers. In: Proceedings of the ACM SIGPLAN 1997 Conference on Programming Language Design and Implementation, Las Vegas, USA (1997)","DOI":"10.1145\/258915.258933"},{"key":"13_CR8","unstructured":"Fan, K., Kudlur, M., Park, H., Mahlke, S.A.: Cost sensitive modulo scheduling in a loop accelerator synthesis system. In: 38th Annual IEEE\/ACM International Symposium on Microarchitecture, Barcelona, Spain (2005)"},{"key":"13_CR9","unstructured":"Gajski, D.D., Dutt, N.D., Wu, A.C., Lin, S.Y.: High-level synthesis: Introduction to Chip and System Design (2012)"},{"key":"13_CR10","first-page":"242","volume":"17","author":"Y Hara","year":"2009","unstructured":"Hara, Y., Tomiyama, H., Honda, S., Takada, H.: Proposal and quantitative analysis of the chstone benchmark program suite for practical c-based high-level synthesis. JIP 17, 242\u2013254 (2009)","journal-title":"JIP"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Li, P., Zhang, P., Pouchet, L., Cong, J.: Resource-aware throughput optimization for high-level synthesis. In: Proceedings of the 2015 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays, Monterey, CA, USA (2015)","DOI":"10.1145\/2684746.2689065"},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3317670","volume":"12","author":"J Oppermann","year":"2019","unstructured":"Oppermann, J., Reuter-Oppermann, M., Sommer, L., Koch, A., Sinnen, O.: Exact and practical modulo scheduling for high-level synthesis. ACM Trans. Reconfigurable Technol. Syst. 12(2), 1\u201326 (2019)","journal-title":"ACM Trans. Reconfigurable Technol. Syst."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Oppermann, J., Reuter-Oppermann, M., Sommer, L., Sinnen, O., Koch, A.: Dependence graph preprocessing for faster exact modulo scheduling in high-level synthesis. In: 28th International Conference on Field Programmable Logic and Applications, Dublin, Ireland (2018)","DOI":"10.1109\/FPL.2018.00055"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Pilato, C., Ferrandi, F.: Bambu: a modular framework for the high level synthesis of memory-intensive applications. In: 23rd International Conference on Field programmable Logic and Applications, Porto, Portugal (2013)","DOI":"10.1109\/FPL.2013.6645550"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF03356742","volume":"24","author":"BR Rau","year":"1996","unstructured":"Rau, B.R.: Iterative modulo scheduling. Int. J. Parallel Program. 24(1), 3\u201364 (1996)","journal-title":"Int. J. Parallel Program."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Reagen, B., Adolf, R., Shao, Y.S., Wei, G., Brooks, D.M.: MachSuite: benchmarks for accelerator design and customized architectures. In: IEEE International Symposium on Workload Characterization, Raleigh, USA (2014)","DOI":"10.1109\/IISWC.2014.6983050"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Sittel, P., Kumm, M., Oppermann, J., M\u00f6ller, K., Zipf, P., Koch, A.: ILP-based modulo scheduling and binding for register minimization. In: 28th International Conference on Field Programmable Logic and Applications, Dublin, Ireland (2018)","DOI":"10.1109\/FPL.2018.00053"},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10589-009-9239-4","volume":"48","author":"P Sucha","year":"2011","unstructured":"Sucha, P., Hanzalek, Z.: A cyclic scheduling problem with an undetermined number of parallel identical processors. Comp. Opt. Appl. 48(1), 71\u201390 (2011)","journal-title":"Comp. Opt. Appl."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2019: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29400-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T00:03:21Z","timestamp":1691885001000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29400-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030293994","9783030294007"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29400-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"G\u00f6ttingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/europar.org\/","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":"142","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":"36","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":"25% - 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":"3,94","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":"4,27","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":"double blind review in two cases","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}