{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T17:57:17Z","timestamp":1765994237138,"version":"3.41.0"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"5s","license":[{"start":{"date-parts":[[2014,10,6]],"date-time":"2014-10-06T00:00:00Z","timestamp":1412553600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Linneaus Center LCCC"},{"name":"ELLIIT Excellence Center"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2014,12,15]]},"abstract":"<jats:p>In embedded real-time systems, task priorities are often assigned to meet deadlines. However, in control tasks, a late completion of a task has no catastrophic consequence; rather, it has a quantifiable impact in the control performance achieved by the task.<\/jats:p>\n          <jats:p>In this article, we address the problem of determining the optimal assignment of priorities and periods of sampled-data control tasks that run over a shared computation unit. We show that the minimization of the overall cost can be performed efficiently using a branch and bound algorithm that can be further speeded up by allowing for a small degree of suboptimality. Detailed numerical simulations are presented to show the advantages of various branching alternatives, the overall algorithm effectiveness, and its scalability with the number of tasks.<\/jats:p>","DOI":"10.1145\/2660496","type":"journal-article","created":{"date-parts":[[2014,10,7]],"date-time":"2014-10-07T12:57:47Z","timestamp":1412686667000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Optimal Priority Assignment to Control Tasks"],"prefix":"10.1145","volume":"13","author":[{"given":"Giulio M.","family":"Mancuso","sequence":"first","affiliation":[{"name":"Scuola Superiore Sant'Anna, Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Bini","sequence":"additional","affiliation":[{"name":"Lund University, Lund, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriele","family":"Pannocchia","sequence":"additional","affiliation":[{"name":"University of Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,10,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/9.35286"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the Design, Automation and Test in Europe Conference (DATE'14)","author":"Aminifar Amir","year":"2014","unstructured":"Amir Aminifar , Enrico Bini , Petru Eles , and Zebo Peng . 2014 . Bandwidth-efficient controller \u2014 Server co-design with stability guarantees . In Proceedings of the Design, Automation and Test in Europe Conference (DATE'14) . Amir Aminifar, Enrico Bini, Petru Eles, and Zebo Peng. 2014. Bandwidth-efficient controller \u2014 Server co-design with stability guarantees. In Proceedings of the Design, Automation and Test in Europe Conference (DATE'14)."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2012.79"},{"key":"e_1_2_1_4_1","volume-title":"Computer-Controlled Systems: Theory and Design","author":"\u00c5str\u00f6m Karl-Johan","unstructured":"Karl-Johan \u00c5str\u00f6m and Bj\u00f6rn Wittenmark . 1997. Computer-Controlled Systems: Theory and Design 3 rd Ed. Prentice Hall . Karl-Johan \u00c5str\u00f6m and Bj\u00f6rn Wittenmark. 1997. Computer-Controlled Systems: Theory and Design 3rd Ed. Prentice Hall.","edition":"3"},{"volume-title":"Department of Computer Science","author":"Audsley Neil","key":"e_1_2_1_5_1","unstructured":"Neil Audsley . 1991. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Tech. rep. YCS 164 , Department of Computer Science , University of York. Neil Audsley. 1991. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Tech. rep. YCS 164, Department of Computer Science, University of York."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2008.45"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.167"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1989.101526"},{"key":"e_1_2_1_9_1","volume-title":"Feedback Control of Dynamic Systems","author":"Franklin Gene","unstructured":"Gene Franklin , Abbas Emami-Naeini , and J. Davis Powell . 1994. Feedback Control of Dynamic Systems 3 rd Ed. Addison-Wesley Longman . Gene Franklin, Abbas Emami-Naeini, and J. Davis Powell. 1994. Feedback Control of Dynamic Systems 3rd Ed. Addison-Wesley Longman.","edition":"3"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2009.2015653"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02598-7"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/29.5.390"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2006.12.006"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/0020718508961183"},{"volume-title":"Linear Optimal Control Systems","author":"Kwakernaak Huibert","key":"e_1_2_1_15_1","unstructured":"Huibert Kwakernaak and Raphael Sivan . 1972. Linear Optimal Control Systems . John Wiley and Sons . Huibert Kwakernaak and Raphael Sivan. 1972. Linear Optimal Control Systems. John Wiley and Sons."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(82)90024-4"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/321738.321743"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.3182\/20110828-6-IT-1002.01545"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104127"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0005-1098(97)00170-2"},{"key":"e_1_2_1_21_1","volume-title":"Rardin","author":"Gary Parker R.","year":"1988","unstructured":"R. Gary Parker and Ronald L . Rardin . 1988 . Discrete Optimization. Academic Press . R. Gary Parker and Ronald L. Rardin. 1988. Discrete Optimization. Academic Press."},{"volume-title":"Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS'96)","author":"Seto Danbing","key":"e_1_2_1_22_1","unstructured":"Danbing Seto , John P. Lehoczky , Lui Sha , and Kang G. Shin . 1996. On task schedulability in real-time control systems . In Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS'96) . 13--21. Danbing Seto, John P. Lehoczky, Lui Sha, and Kang G. Shin. 1996. On task schedulability in real-time control systems. In Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS'96). 13--21."},{"key":"e_1_2_1_23_1","first-page":"39","article-title":"Optimal period and priority assignment for a networked control system scheduled by a fixed priority scheduling system","volume":"8","author":"Shin M.","year":"2007","unstructured":"M. Shin and Myoungho Sunwoo . 2007 . Optimal period and priority assignment for a networked control system scheduled by a fixed priority scheduling system . Int. J. Automot. Technol. 8 , 1, 39 -- 48 . M. Shin and Myoungho Sunwoo. 2007. Optimal period and priority assignment for a networked control system scheduled by a fixed priority scheduling system. Int. J. Automot. Technol. 8, 1, 39--48.","journal-title":"Int. J. Automot. Technol."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2011.15"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-4754(93)90041-R"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2010.2053378"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.3182\/20140824-6-ZA-1003.00289"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660496","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2660496","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:11:54Z","timestamp":1750227114000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,6]]},"references-count":27,"journal-issue":{"issue":"5s","published-print":{"date-parts":[[2014,12,15]]}},"alternative-id":["10.1145\/2660496"],"URL":"https:\/\/doi.org\/10.1145\/2660496","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2014,10,6]]},"assertion":[{"value":"2013-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-10-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}