| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 402.84 KB | Adobe PDF |
Advisor(s)
Abstract(s)
Consider the problem of designing an algorithm with
a high utilisation bound for scheduling sporadic tasks
with implicit deadlines on identical processors. A task is
characterised by its minimum interarrival time and its execution
time. Task preemption and migration is permitted.
Still, low preemption and migration counts are desirable.
We formulate an algorithm with a utilisation bound no
less than 66.¯6%, characterised by worst-case preemption
counts comparing favorably against the state-of-the-art.