Competitive Analysis of Static-Priority Partitioned Scheduling on Uniform Multiprocessors

Authors:
Bjorn Andersson;Eduardo Tovar
Affiliations:
Polytechnic Institute of Porto;Polytechnic Institute of Porto
Venue:
RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2007

Citing 0
Cited 2

Deadline Monotonic Scheduling on Uniform Multiprocessors

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. On each processor, tasks are scheduled according to rate-monotonic. We propose an algorithm that can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are. 3.41 times faster. No such guarantees are previously known for partitioned static-priority scheduling on uniform multiprocessors.