| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 263.75 KB | Adobe PDF |
Advisor(s)
Abstract(s)
Consider the problem of scheduling a set of
implicit-deadline sporadic tasks to meet all deadlines on a
heterogeneous multiprocessor platform. We use an algorithm
proposed in [1] (we refer to it as LP-EE) from state-of-the-art
for assigning tasks to heterogeneous multiprocessor platform
and (re-)prove its performance guarantee but for a stronger
adversary.We conjecture that if a task set can be scheduled to
meet deadlines on a heterogeneous multiprocessor platform
by an optimal task assignment scheme that allows task
migrations then LP-EE meets deadlines as well with no
migrations if given processors twice as fast. We illustrate
this with an example.
Description
Keywords
Heterogeneous multiprocessor Task migrations Real-time scheduling