The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50%

Andersson, Björn2014-02-182014-02-182008978-1-59593-753-7http://hdl.handle.net/10400.22/3963Consider the problem of scheduling a set of sporadically arriving implicit-deadline tasks to meet deadlines on a uniprocessor. Static-priority scheduling is considered using the slack-monotonic priority-assignment scheme. We prove that its utilization bound is 50%.engReal-timeEmbedded systemsAlgorithmsPerformanceThe utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50%journal article10.1145/1363686.1363760