{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:19:55Z","timestamp":1759033195171,"version":"3.41.0"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"2s","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"BRL"},{"name":"BSRP"},{"DOI":"10.13039\/501100003662","name":"KEIT","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003662","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001475","name":"Nanyang Technological University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001475","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003665","name":"National IT Industry Promotion Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003621","name":"Ministry of Science, ICT and Future Planning","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003661","name":"Korea Institute for Advancement of Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004085","name":"Ministry of Education, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004085","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":[[2014,1]]},"abstract":"<jats:p>\n            A time slot is defined as\n            <jats:italic>contention-free<\/jats:italic>\n            if the number of jobs with remaining executions in the slot is no larger than the number of processors, or\n            <jats:italic>contending<\/jats:italic>\n            , otherwise. Then an important property holds that in any contention-free slot, all jobs with remaining executions are guaranteed to be scheduled as long as the scheduler is work-conserving. This article aims at improving schedulability by utilizing the contention-free slots. To achieve this, this article presents a policy (called CF policy) that moves some job executions from contending slots to contention-free ones. This policy can be employed by any work-conserving, preemptive scheduling algorithm, and we show that any algorithm extended with this policy dominates the original algorithm in terms of schedulability. We also present improved schedulability tests for algorithms that employ this policy, based on the observation that interference from jobs is reduced when their executions are postponed to contention-free slots. Simulation results demonstrate that the CF policy, incorporated into existing algorithms, significantly improves schedulability of those existing algorithms.\n          <\/jats:p>","DOI":"10.1145\/2494530","type":"journal-article","created":{"date-parts":[[2014,2,4]],"date-time":"2014-02-04T14:16:21Z","timestamp":1391523381000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Contention-free executions for real-time multiprocessor scheduling"],"prefix":"10.1145","volume":"13","author":[{"given":"Jinkyu","family":"Lee","sequence":"first","affiliation":[{"name":"Sungkyunkwan University, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arvind","family":"Easwaran","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Insik","family":"Shin","sequence":"additional","affiliation":[{"name":"KAIST, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,1,27]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"AUTOSAR. 2009. AUTOSAR release 4.0 specification. http:\/\/www.autosar.org.  AUTOSAR. 2009. AUTOSAR release 4.0 specification. http:\/\/www.autosar.org."},{"volume-title":"ARINC specification 653-1. Aeronautical Radio","author":"Airlines Electronic Engineering Committee","key":"e_1_2_1_2_1","unstructured":"Airlines Electronic Engineering Committee . 2003. ARINC specification 653-1. Aeronautical Radio , INC. , Annapolis, MD . Airlines Electronic Engineering Committee. 2003. ARINC specification 653-1. Aeronautical Radio, INC., Annapolis, MD."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2008.44"},{"volume-title":"Comparison of empirical success rates of global vs. partitioned fixed-priority and EDF scheduling for hand real time. Tech. rep. TR-050601. Department of Computer Science","author":"Baker Theodore P.","key":"e_1_2_1_4_1","unstructured":"Theodore P. Baker . 2005. Comparison of empirical success rates of global vs. partitioned fixed-priority and EDF scheduling for hand real time. Tech. rep. TR-050601. Department of Computer Science , Florida State University , Tallahasee . Theodore P. Baker. 2005. Comparison of empirical success rates of global vs. partitioned fixed-priority and EDF scheduling for hand real time. Tech. rep. TR-050601. Department of Computer Science, Florida State University, Tallahasee."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2006.7"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-008-9061-6"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.16"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2007.48"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940883"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1990.128746"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2007.41"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2005.18"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.129"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5626\/JCSE.2008.2.1.074"},{"key":"e_1_2_1_15_1","first-page":"2859","article-title":"Efficient real-time scheduling algorithms for multiprocessor systems. IEICE","volume":"12","author":"Cho S.","year":"2002","unstructured":"S. Cho , S.-K. Lee , S. Ahn , and K.-J. Lin . 2002 . Efficient real-time scheduling algorithms for multiprocessor systems. IEICE Trans. Commun. E85--B , 12 , 2859 -- 2867 . S. Cho, S.-K. Lee, S. Ahn, and K.-J. Lin. 2002. Efficient real-time scheduling algorithms for multiprocessor systems. IEICE Trans. Commun. E85--B, 12, 2859--2867.","journal-title":"Trans. Commun. E85--B"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2011.31"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1978802.1978814"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the IFIP Congress. 807--813","author":"Dertouzos M.","year":"1974","unstructured":"M. Dertouzos . 1974 . Control robotics: The procedural control of physical processors . In Proceedings of the IFIP Congress. 807--813 . M. Dertouzos. 1974. Control robotics: The procedural control of physical processors. In Proceedings of the IFIP Congress. 807--813."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2009.11"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1266366.1266723"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2009.22"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2010.13"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2011.30"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2011.07.002"},{"volume-title":"Proceedings of the IEEE Region 10's 9th Annual International Conference. 607--611","key":"e_1_2_1_25_1","unstructured":"On-line multiprocessor scheduling algorithms for real-time tasks . In Proceedings of the IEEE Region 10's 9th Annual International Conference. 607--611 . On-line multiprocessor scheduling algorithms for real-time tasks. In Proceedings of the IEEE Region 10's 9th Annual International Conference. 607--611."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(82)90024-4"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01553887"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/321738.321743"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/e88-d.3.658"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00231-4"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1874620.1874924"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2494530","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2494530","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:55Z","timestamp":1750231735000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2494530"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":31,"journal-issue":{"issue":"2s","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["10.1145\/2494530"],"URL":"https:\/\/doi.org\/10.1145\/2494530","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2014,1]]},"assertion":[{"value":"2012-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-01-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}