{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:24Z","timestamp":1750306584372,"version":"3.41.0"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2015,3,27]],"date-time":"2015-03-27T00:00:00Z","timestamp":1427414400000},"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":[[2015,3,27]]},"abstract":"<jats:p>In this paper we revisit the admission of applications upon a processor share modeled by the explicit-deadline periodic (EDP) resource-supply model. In particular, we consider applications that represent a fixed-priority sporadic task system. Existing works heavily build on the analysis of a hierarchy of preemptive task schedulers. We instead consider the feasibility of such tasks and applications for a hierarchy of deferred-preemptive schedulers, so that we can efficiently deal with the scenario where tasks and applications execute their work in non-preemptive chunks. Our model therefore gives better control over preemptions of tasks of different applications.<\/jats:p>\n          <jats:p>We present exact analysis for deferred-preemptive scheduling of tasks on EDP resources. In addition, we propose algorithms for dimensioning an application's budget tightly.<\/jats:p>","DOI":"10.1145\/2752801.2752804","type":"journal-article","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T14:59:12Z","timestamp":1427900352000},"page":"19-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Budget allocations for hierarchical fixed-priority scheduling of sporadic tasks with deferred preemptions upon EDP resources"],"prefix":"10.1145","volume":"12","author":[{"given":"Martijn M. H. P.","family":"van den Heuvel","sequence":"first","affiliation":[{"name":"Technische Universiteit Eindhoven (TU\/e), The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinder J.","family":"Bril","sequence":"additional","affiliation":[{"name":"Technische Universiteit Eindhoven (TU\/e), The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan J.","family":"Lukkien","sequence":"additional","affiliation":[{"name":"Technische Universiteit Eindhoven (TU\/e), The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,3,27]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00365393"},{"issue":"1","key":"e_1_2_1_2_1","first-page":"93","article-title":"Overrun methods and resource holding times for hierarchical scheduling of semi-independent real-time systems","volume":"6","author":"Behnam M.","year":"2010","unstructured":"M. Behnam , T. Nolte , M. Sjodin , and I. Shin . Overrun methods and resource holding times for hierarchical scheduling of semi-independent real-time systems . IEEE TII , 6 ( 1 ): 93 -- 104 , Feb. 2010 . M. Behnam, T. Nolte, M. Sjodin, and I. Shin. Overrun methods and resource holding times for hierarchical scheduling of semi-independent real-time systems. IEEE TII, 6(1): 93--104, Feb. 2010.","journal-title":"IEEE TII"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2010.9"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2011.30"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2011.28"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2516821.2516824"},{"key":"e_1_2_1_7_1","first-page":"225","volume-title":"Advances in Real-Time Systems","author":"Burns A.","year":"1994","unstructured":"A. Burns . Preemptive priority based scheduling: An appropriate engineering approach . In S. Son, editor, Advances in Real-Time Systems , pages 225 -- 248 . Prentice-Hall , 1994 . A. Burns. Preemptive priority based scheduling: An appropriate engineering approach. In S. Son, editor, Advances in Real-Time Systems, pages 225--248. Prentice-Hall, 1994."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2012.57"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2006.42"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/827269.828992"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2010.28"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2007.17"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/882482.883800"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01094172"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1990.128748"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1233760.1233768"},{"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.1109\/32.469457"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2516821.2516831"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-009-9071-z"},{"key":"e_1_2_1_21_1","volume-title":"CRTS","author":"Bril R. J.","year":"2009","unstructured":"R. J. Bril , U. Keskin , M. Behnam , and T. Nolte . Schedulability analysis of synchronization protocols based on overrun without payback for hierarchical scheduling frameworks revisited . In CRTS , Dec. 2009 . R. J. Bril, U. Keskin, M. Behnam, and T. Nolte. Schedulability analysis of synchronization protocols based on overrun without payback for hierarchical scheduling frameworks revisited. In CRTS, Dec. 2009."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2038642.2038671"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTCSA.2009.44"}],"container-title":["ACM SIGBED Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2752801.2752804","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2752801.2752804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:22Z","timestamp":1750227382000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2752801.2752804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,27]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,3,27]]}},"alternative-id":["10.1145\/2752801.2752804"],"URL":"https:\/\/doi.org\/10.1145\/2752801.2752804","relation":{},"ISSN":["1551-3688"],"issn-type":[{"type":"electronic","value":"1551-3688"}],"subject":[],"published":{"date-parts":[[2015,3,27]]},"assertion":[{"value":"2015-03-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}