{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:08Z","timestamp":1750221068542,"version":"3.41.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T00:00:00Z","timestamp":1534723200000},"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":["SIGBED Rev."],"published-print":{"date-parts":[[2018,8,20]]},"abstract":"<jats:p>In designing and analyzing real-time systems, the central problem resides in finding a feasible schedule for a given task set, if one exists. A lot of research effort has been carried out in approaching the various aspects of task scheduling. While most results have been achieved for preemptive scheduling, the non-preemptive case has still room for improvement, due to its complexity. In addition, the widespread usage of cyber-physical systems (CPS) is putting real-time scheduling in the position to deal with new challenges, as additional (and sometimes particular) requirements are raised by such systems.<\/jats:p>\n          <jats:p>This paper, which continues the previous work of the authors, introduces a new lower bound on the number of processing units that allows a feasible schedule of a task set for both preemptive and non-preemptive scheduling. As a specific CPS issue, the necessity of moving the processing units in space, which incurs additional time requirements, is considered. The single-instance case is first discussed, then the results are extended to the periodic case.<\/jats:p>","DOI":"10.1145\/3269482.3269486","type":"journal-article","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T12:09:47Z","timestamp":1534853387000},"page":"20-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounding execution resources for the task scheduling problem in cyber-physical systems"],"prefix":"10.1145","volume":"15","author":[{"given":"Vlad","family":"R\u0103dulescu","sequence":"first","affiliation":[{"name":"A. I. Cuza University of Ia\u015fi, Ia\u015fi, Romania"}]},{"given":"\u015etefan","family":"Andrei","sequence":"additional","affiliation":[{"name":"Lamar University"}]},{"given":"Albert M. K.","family":"Cheng","sequence":"additional","affiliation":[{"name":"University of Houston"}]}],"member":"320","published-online":{"date-parts":[[2018,8,20]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/647907.739825"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJGUC.2012.051422"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2011.21"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2015.32"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-006-4961-9"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90172-R"},{"key":"e_1_2_1_7_1","first-page":"1","article-title":"Limited Preemptive Scheduling for Real-Time Systems: a Survey","volume":"9","author":"Buttazzo G. C.","journal-title":"IEEE Transactions on Industrial Informatics ("},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940882"},{"volume-title":"Chapman Hall\/CRC","year":"2004","author":"Carpenter J.","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.02.014"},{"volume-title":"Inc.","year":"2002","author":"Real-Time Systems Albert M. K.","key":"e_1_2_1_11_1"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2011.31"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-012-9149-x"},{"key":"e_1_2_1_14_1","first-page":"807","article-title":"The procedural control of physical processes","volume":"74","author":"Dertouzos M. L.","year":"1974","journal-title":"Information Processing"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.58762"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008033411290"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2008.919017"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2008.17"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90012-4"},{"key":"e_1_2_1_20_1","first-page":"145","article-title":"Preemptive scheduling of two-processor tasks on dedicated processors","volume":"1082","author":"Kubale M.","year":"1990","journal-title":"Automatyka"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISORC.2008.25"},{"key":"e_1_2_1_22_1","first-page":"607","volume-title":"TENCON '94. IEEE Regions 10's Ninth Annual International Conference","author":"Lee S. K.","year":"1994"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/UIC-ATC-ScalCom.2014.97"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2008.923787"},{"volume-title":"Massachusetts Institute of Technology","year":"1983","author":"Mok A. K.","key":"e_1_2_1_25_1"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2748143.2748363"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1880050.1880063"},{"key":"e_1_2_1_28_1","first-page":"157","volume-title":"Proceedings of 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'16)","author":"R\u0103dulescu V.","year":"2016"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.57058"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.386982"}],"container-title":["ACM SIGBED Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269482.3269486","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3269482.3269486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:20Z","timestamp":1750208240000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269482.3269486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,20]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,8,20]]}},"alternative-id":["10.1145\/3269482.3269486"],"URL":"https:\/\/doi.org\/10.1145\/3269482.3269486","relation":{},"ISSN":["1551-3688"],"issn-type":[{"type":"electronic","value":"1551-3688"}],"subject":[],"published":{"date-parts":[[2018,8,20]]},"assertion":[{"value":"2018-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}