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

Andersson, Björn

http://hdl.handle.net/10400.22/3963

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
ART_BjornAndersson_2008_CISTER.pdf		81.86 KB	Adobe PDF	Download

Send Feedback

Authors

Andersson, Björn

Abstract(s)

Consider 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%.