| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 176.44 KB | Adobe PDF |
Authors
Advisor(s)
Abstract(s)
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 √2 / √2−1 ≈ 3.41 times faster. No such guarantees are previously
known for partitioned static-priority scheduling on
uniform multiprocessors.
Description
Keywords
Citation
Publisher
IEEE