{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T13:15:54Z","timestamp":1758892554796,"version":"3.41.0"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2017,11,27]],"date-time":"2017-11-27T00:00:00Z","timestamp":1511740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2018,3,31]]},"abstract":"<jats:p>Due to its complexity, the problem of mapping and scheduling streaming applications on heterogeneous MPSoCs under real-time and performance constraints has traditionally been tackled by incomplete heuristic algorithms. In recent years, approaches based on Constraint Programming (CP) have shown promising results as complete methods for finding optimal mappings, in particular concerning throughput. However, so far none of the available CP approaches consider the tradeoff between throughput and buffer requirements or throughput and power consumption. This article integrates tradeoff awareness into the CP model and introduces a two-step solving approach that utilizes the advantages of heuristics, while still keeping the completeness property of CP. With a number of experiments considering several streaming applications and different platform models, the article illustrates not only the efficiency of the presented model but also its suitability for solving different problems with various combinations of performance constraints.<\/jats:p>","DOI":"10.1145\/3133210","type":"journal-article","created":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T13:21:34Z","timestamp":1511875294000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Flexible and Tradeoff-Aware Constraint-Based Design Space Exploration for Streaming Applications on Heterogeneous Platforms"],"prefix":"10.1145","volume":"23","author":[{"given":"Kathrin","family":"Rosvall","sequence":"first","affiliation":[{"name":"KTH Royal Institute of Technology, Kista, Sweden"}]},{"given":"Ingo","family":"Sander","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Kista, Sweden"}]}],"member":"320","published-online":{"date-parts":[[2017,11,27]]},"reference":[{"volume-title":"Proceedings of the 14th International Conference on Application of Concurrency to System Design (ACSD\u201914)","author":"Ahmad Waheed","key":"e_1_2_1_1_1","unstructured":"Waheed Ahmad , Robert de Groote , Philip K. F. H\u00f6lzenspies , Mari\u00eblle Stoelinga , and Jaco van de Pol. 2014. Resource-constrained optimal scheduling of synchronous dataflow graphs via timed automata . In Proceedings of the 14th International Conference on Application of Concurrency to System Design (ACSD\u201914) . 72--81. Waheed Ahmad, Robert de Groote, Philip K. F. H\u00f6lzenspies, Mari\u00eblle Stoelinga, and Jaco van de Pol. 2014. Resource-constrained optimal scheduling of synchronous dataflow graphs via timed automata. In Proceedings of the 14th International Conference on Application of Concurrency to System Design (ACSD\u201914). 72--81."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020307222052"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.1997.606831"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1995.479579"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2010.5456924"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2013.05.004"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.728912"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 11th ACM\/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE\u201913)","author":"de Groote Robert","year":"2013","unstructured":"Robert de Groote , Philip K. F. H\u00f6lzenspies , Jan Kuper , and Hajo Broersma . 2013 . Back to basics: Homogeneous representations of multi-rate synchronous dataflow graphs . In Proceedings of the 11th ACM\/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE\u201913) . 35--46. Robert de Groote, Philip K. F. H\u00f6lzenspies, Jan Kuper, and Hajo Broersma. 2013. Back to basics: Homogeneous representations of multi-rate synchronous dataflow graphs. In Proceedings of the 11th ACM\/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE\u201913). 35--46."},{"volume-title":"Retrieved","year":"2017","key":"e_1_2_1_9_1","unstructured":"DeSyDe 2017 . DeSyDe . Retrieved September 18, 2017 from https:\/\/github.com\/forsyde\/DeSyDe. DeSyDe 2017. DeSyDe. Retrieved September 18, 2017 from https:\/\/github.com\/forsyde\/DeSyDe."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.7873\/DATE.2013.243"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSD.2006.33"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2544350.2544353"},{"key":"e_1_2_1_13_1","article-title":"CoMPSoC: A template for composable and predictable multi-processor system on chips","volume":"14","author":"Hansson Andreas","year":"2009","unstructured":"Andreas Hansson , Kees Goossens , Marco Bekooij , and Jos Huisken . 2009 . CoMPSoC: A template for composable and predictable multi-processor system on chips . ACM Trans. Des. Autom. Electr. Syst. 14 , 1, Article 2 (Jan. 2009), 2:1--2:24 pages. Andreas Hansson, Kees Goossens, Marco Bekooij, and Jos Huisken. 2009. CoMPSoC: A template for composable and predictable multi-processor system on chips. ACM Trans. Des. Autom. Electr. Syst. 14, 1, Article 2 (Jan. 2009), 2:1--2:24 pages.","journal-title":"ACM Trans. Des. Autom. Electr. Syst."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02107055"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1987.13876"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.736561"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1450095.1450117"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2014.08.015"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2005.33"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1814539.1814548"},{"volume-title":"Handbook of Knowledge Representation","author":"Rossi Francesca","key":"e_1_2_1_21_1","unstructured":"Francesca Rossi , Peter van Beek , and Toby Walsh . 2007. Constraint programming . In Handbook of Knowledge Representation . Elsevier , Chapter 4. Francesca Rossi, Peter van Beek, and Toby Walsh. 2007. Constraint programming. In Handbook of Knowledge Representation. Elsevier, Chapter 4."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3023973.3023977"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the Design, Automation 8 Test in Europe Conference 8 Exhibition (DATE\u201914)","author":"Rosvall Kathrin","year":"2014","unstructured":"Kathrin Rosvall and Ingo Sander . 2014 . A constraint-based design space exploration framework for real-time applications on MPSoCs . In Proceedings of the Design, Automation 8 Test in Europe Conference 8 Exhibition (DATE\u201914) . 1--6. Kathrin Rosvall and Ingo Sander. 2014. A constraint-based design space exploration framework for real-time applications on MPSoCs. In Proceedings of the Design, Automation 8 Test in Europe Conference 8 Exhibition (DATE\u201914). 1--6."},{"key":"e_1_2_1_24_1","volume-title":"Lagerkvist","author":"Schulte Christian","year":"2017","unstructured":"Christian Schulte , Guido Tack , and Mikael Z . Lagerkvist . 2017 . Modeling and Programming with Gecode. Retreived from http:\/\/www.gecode.org\/documentation.html. Christian Schulte, Guido Tack, and Mikael Z. Lagerkvist. 2017. Modeling and Programming with Gecode. Retreived from http:\/\/www.gecode.org\/documentation.html."},{"key":"e_1_2_1_25_1","volume-title":"Bhattacharyya","author":"Sriram Sundararajan","year":"2000","unstructured":"Sundararajan Sriram and Shuvra S . Bhattacharyya . 2000 . Embedded Multiprocessors : Scheduling and Synchronization (1st ed.). Marcel Dekker , Inc. Sundararajan Sriram and Shuvra S. Bhattacharyya. 2000. Embedded Multiprocessors: Scheduling and Synchronization (1st ed.). Marcel Dekker, Inc."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278480.1278674"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147138"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1574-6526(06)80008-8"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/362652.362660"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1347375.1347389"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the Design, Automation 8 Test in Europe Conference 8 Exhibition (DATE\u201914)","author":"Zhu Xue-Yang","year":"2014","unstructured":"Xue-Yang Zhu , Marc Geilen , Twan Basten , and Sander Stuijk . 2014 . Memory-constrained static rate-optimal scheduling of synchronous dataflow graphs via retiming . In Proceedings of the Design, Automation 8 Test in Europe Conference 8 Exhibition (DATE\u201914) . 1--6. Xue-Yang Zhu, Marc Geilen, Twan Basten, and Sander Stuijk. 2014. Memory-constrained static rate-optimal scheduling of synchronous dataflow graphs via retiming. In Proceedings of the Design, Automation 8 Test in Europe Conference 8 Exhibition (DATE\u201914). 1--6."}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133210","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:10:59Z","timestamp":1750212659000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,27]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,3,31]]}},"alternative-id":["10.1145\/3133210"],"URL":"https:\/\/doi.org\/10.1145\/3133210","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"type":"print","value":"1084-4309"},{"type":"electronic","value":"1557-7309"}],"subject":[],"published":{"date-parts":[[2017,11,27]]},"assertion":[{"value":"2017-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-11-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}