{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:14Z","timestamp":1750307474554,"version":"3.41.0"},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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","award":["ArtistDesign ICT-NoE-214373"],"award-info":[{"award-number":["ArtistDesign ICT-NoE-214373"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGBED Rev."],"published-print":{"date-parts":[[2010,1]]},"abstract":"<jats:p>It has been widely studied how to schedule realtime tasks on multiprocessor platforms. Several studies find optimal scheduling policies for implicit deadline task systems, but it is hard to understand how each policy utilizes the two important aspects of scheduling real-time tasks on multiprocessors: inter-job concurrency and job urgency. In this paper, we introduce a new scheduling policy that considers these two properties. We prove that the policy is optimal for the special case when the execution time of all tasks are equally one and deadlines are implicit, and observe that the policy is a new concept in that it is not an instance of Pfair or ERfair. It remains open to find a scheduliability condition for general task systems under our scheduling policy.<\/jats:p>","DOI":"10.1145\/1851166.1851173","type":"journal-article","created":{"date-parts":[[2010,8,31]],"date-time":"2010-08-31T13:05:55Z","timestamp":1283259955000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Multiprocessor real-time scheduling considering concurrency and urgency"],"prefix":"10.1145","volume":"7","author":[{"given":"Jinkyu","family":"Lee","sequence":"first","affiliation":[{"name":"KAIST, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arvind","family":"Easwaran","sequence":"additional","affiliation":[{"name":"Polytechnic Institute of Porto (ISEP-IPP), Portugal"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Insik","family":"Shin","sequence":"additional","affiliation":[{"name":"KAIST, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Insup","family":"Lee","sequence":"additional","affiliation":[{"name":"University of Pennsylvania"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,1]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/321738.321743"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(82)90024-4"},{"key":"e_1_2_1_3_1","first-page":"12","article-title":"Efficient real-time scheduling algorithms for multiprocessor systems","volume":"85","author":"Cho S.","year":"2002","unstructured":"S. Cho , S.-K. Lee , S. Ahn , and K.-J. Lin , \" Efficient real-time scheduling algorithms for multiprocessor systems ,\" IEICE Trans. on Communications , vol. E85 --B, no. 12 , pp. 2859--2867, 2002 . S. Cho, S.-K. Lee, S. Ahn, and K.-J. Lin, \"Efficient real-time scheduling algorithms for multiprocessor systems,\" IEICE Trans. on Communications, vol. E85--B, no. 12, pp. 2859--2867, 2002.","journal-title":"IEICE Trans. on Communications"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00231-4"},{"key":"e_1_2_1_5_1","volume-title":"Static-priority scheduling on multiprocessors,\" in RTSS","author":"Andersson B.","year":"2001","unstructured":"B. Andersson , S. Baruah , and J. Jonsson , \" Static-priority scheduling on multiprocessors,\" in RTSS , 2001 . B. Andersson, S. Baruah, and J. Jonsson, \"Static-priority scheduling on multiprocessors,\" in RTSS, 2001."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940883"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2006.10"},{"key":"e_1_2_1_8_1","first-page":"35","article-title":"Early-release fair scheduling","author":"Anderson J. H.","year":"2000","unstructured":"J. H. Anderson and A. Srinivasan , \" Early-release fair scheduling ,\" in ECRTS , 2000 , pp. 35 -- 43 . J. H. Anderson and A. Srinivasan, \"Early-release fair scheduling,\" in ECRTS, 2000, pp. 35--43.","journal-title":"ECRTS"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTCSA.2006.45"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2008.15"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2008.9"},{"key":"e_1_2_1_12_1","volume-title":"Preemptively scheduling hard-real-time sporadic tasks on one processor,\" in RTSS","author":"Baruah S.","year":"1990","unstructured":"S. Baruah , A. Mok , and L. Rosier , \" Preemptively scheduling hard-real-time sporadic tasks on one processor,\" in RTSS , 1990 . S. Baruah, A. Mok, and L. Rosier, \"Preemptively scheduling hard-real-time sporadic tasks on one processor,\" in RTSS, 1990."}],"container-title":["ACM SIGBED Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1851166.1851173","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1851166.1851173","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:49Z","timestamp":1750248529000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1851166.1851173"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["10.1145\/1851166.1851173"],"URL":"https:\/\/doi.org\/10.1145\/1851166.1851173","relation":{},"ISSN":["1551-3688"],"issn-type":[{"type":"electronic","value":"1551-3688"}],"subject":[],"published":{"date-parts":[[2010,1]]},"assertion":[{"value":"2010-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}