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

Authors:
Björn Andersson
Affiliations:
IPP Hurray Research Group ISEP/IPP, Porto, Portugal
Venue:
Proceedings of the 2008 ACM symposium on Applied computing
Year:
2008

Citing 4
Cited 0

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems

IEEE Transactions on Parallel and Distributed Systems
Effective Analysis for Engineering Real-Time Fixed Priority Schedulers

IEEE Transactions on Software Engineering
Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition

RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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