{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T10:08:09Z","timestamp":1767262089694,"version":"3.41.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"5s","license":[{"start":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T00:00:00Z","timestamp":1506470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["Horizon 2020 Research and Innovation Action, Grant Agreement Number 688131"],"award-info":[{"award-number":["Horizon 2020 Research and Innovation Action, Grant Agreement Number 688131"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2017,10,31]]},"abstract":"<jats:p>Multi-core systems are increasingly interesting candidates for executing parallel real-time applications, in avionic, space or automotive industries, as they provide both computing capabilities and power efficiency. However, ensuring that timing constraints are met on such platforms is challenging, because some hardware resources are shared between cores.<\/jats:p>\n          <jats:p>\n            Assuming worst-case contentions when analyzing the schedulability of applications may result in systems mistakenly declared unschedulable, although the worst-case level of contentions can never occur in practice. In this paper, we present two\n            <jats:italic>contention-aware<\/jats:italic>\n            scheduling strategies that produce a time-triggered schedule of the application\u2019s tasks. Based on knowledge of the application\u2019s structure, our scheduling strategies precisely estimate the\n            <jats:italic>effective<\/jats:italic>\n            contentions, in order to minimize the overall makespan of the schedule. An Integer Linear Programming (ILP) solution of the scheduling problem is presented, as well as a heuristic solution that generates schedules very close to ones of the ILP (5% longer on average), with a much lower time complexity. Our heuristic improves by 19% the overall makespan of the resulting schedules compared to a worst-case contention baseline.\n          <\/jats:p>","DOI":"10.1145\/3126496","type":"journal-article","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T12:33:53Z","timestamp":1506515633000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Tightening Contention Delays While Scheduling Parallel Applications on Multi-core Architectures"],"prefix":"10.1145","volume":"16","author":[{"given":"Benjamin","family":"Rouxel","sequence":"first","affiliation":[{"name":"University of Rennes 1\/IRISA, Rennes, France"}]},{"given":"Steven","family":"Derrien","sequence":"additional","affiliation":[{"name":"University of Rennes 1\/IRISA, Rennes, France"}]},{"given":"Isabelle","family":"Puaut","sequence":"additional","affiliation":[{"name":"University of Rennes 1\/IRISA, Rennes, France"}]}],"member":"320","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Automation and Test in Europe Conference and Exhibition (DATE)","author":"Alhammad Ahmed","year":"2014","unstructured":"Ahmed Alhammad and Rodolfo Pellizzoni . 2014 . Time-predictable execution of multithreaded applications on multicore systems. In Design , Automation and Test in Europe Conference and Exhibition (DATE) , 2014. IEEE, 1--6. Ahmed Alhammad and Rodolfo Pellizzoni. 2014. Time-predictable execution of multithreaded applications on multicore systems. In Design, Automation and Test in Europe Conference and Exhibition (DATE), 2014. IEEE, 1--6."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2016.14"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/ited.7.2.153"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2009.27"},{"key":"e_1_2_1_5_1","volume-title":"Johnson","author":"Coffman Edward G.","year":"1996","unstructured":"Edward G. Coffman Jr , Michael R. Garey , and David S . Johnson . 1996 . Approximation algorithms for bin packing: A survey. In Approximation Algorithms for NP-hard Problems. PWS Publishing Co. , 46--93. Edward G. Coffman Jr, Michael R. Garey, and David S. Johnson. 1996. Approximation algorithms for bin packing: A survey. In Approximation Algorithms for NP-hard Problems. PWS Publishing Co., 46--93."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC.2012.212"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-015-9229-9"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1978802.1978814"},{"key":"e_1_2_1_9_1","volume-title":"Automation and Test in Europe Conference and Exhibition (DATE)","author":"De Dinechin Beno\u00eet Dupont","year":"2014","unstructured":"Beno\u00eet Dupont De Dinechin , Duco Van Amstel , Marc Poulhi\u00e8s , and Guillaume Lager . 2014 . Time-critical computing on a single-chip massively parallel processor. In Design , Automation and Test in Europe Conference and Exhibition (DATE) , 2014. IEEE, 1--6. Beno\u00eet Dupont De Dinechin, Duco Van Amstel, Marc Poulhi\u00e8s, and Guillaume Lager. 2014. Time-critical computing on a single-chip massively parallel processor. In Design, Automation and Test in Europe Conference and Exhibition (DATE), 2014. IEEE, 1--6."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/3130379.3130445"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/278241.278309"},{"key":"e_1_2_1_12_1","volume-title":"Eduardo Qui nones Moreno, Christine Rochange, Tullio Vardanega, Francisco Javier Cazorla Almeida, et al.","author":"Fernandez Gabriel","year":"2014","unstructured":"Gabriel Fernandez , Jaume Abella Ferrer , Eduardo Qui nones Moreno, Christine Rochange, Tullio Vardanega, Francisco Javier Cazorla Almeida, et al. 2014 . Contention in multicore hardware shared resources: Understanding of the state of the art. (2014). Gabriel Fernandez, Jaume Abella Ferrer, Eduardo Qui nones Moreno, Christine Rochange, Tullio Vardanega, Francisco Javier Cazorla Almeida, et al. 2014. Contention in multicore hardware shared resources: Understanding of the state of the art. (2014)."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-015-9227-y"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/605432.605428"},{"volume-title":"Linear and Nonlinear Optimization","author":"Griva Igor","key":"e_1_2_1_15_1","unstructured":"Igor Griva , Stephen G. Nash , and Ariela Sofer . 2008. Linear and Nonlinear Optimization , Second Edition. Society for Industrial Mathematics . Igor Griva, Stephen G. Nash, and Ariela Sofer. 2008. Linear and Nonlinear Optimization, Second Edition. Society for Industrial Mathematics."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2997465.2997472"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2834848.2834874"},{"key":"e_1_2_1_18_1","unstructured":"Timon Kelter Tim Harde Peter Marwedel and Heiko Falk. 2013. Evaluation of resource arbitration methods for multi-core real-time systems. In WCET. 1--10.  Timon Kelter Tim Harde Peter Marwedel and Heiko Falk. 2013. Evaluation of resource arbitration methods for multi-core real-time systems. In WCET. 1--10."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2014.6925998"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1874620.1874748"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2011.33"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1870926.1871108"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00263928"},{"volume-title":"Compiler Construction","author":"Thies William","key":"e_1_2_1_25_1","unstructured":"William Thies , Michal Karczmarek , and Saman Amarasinghe . 2002. StreamIt: A language for streaming applications . In Compiler Construction . Springer , 179--196. William Thies, Michal Karczmarek, and Saman Amarasinghe. 2002. StreamIt: A language for streaming applications. In Compiler Construction. Springer, 179--196."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321107"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2015.24"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3126496","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3126496","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:05:01Z","timestamp":1750273501000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3126496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,27]]},"references-count":26,"journal-issue":{"issue":"5s","published-print":{"date-parts":[[2017,10,31]]}},"alternative-id":["10.1145\/3126496"],"URL":"https:\/\/doi.org\/10.1145\/3126496","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2017,9,27]]},"assertion":[{"value":"2017-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-09-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}