Publication
A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary
| Summary: | 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. |
|---|---|
| Main Authors: | Raravi, Gurulingesh |
| Other Authors: | Andersson, Björn; Bletsas, Konstantinos |
| Subject: | Heterogeneous multiprocessor Task migrations Real-time scheduling |
| Year: | 2011 |
| Country: | Portugal |
| Document type: | report |
| Access type: | open access |
| Associated institution: | Instituto Politécnico do Porto |
| Language: | English |
| Origin: | Repositório Científico do Instituto Politécnico do Porto |
| Summary: | 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. |
|---|
Funded activities
No funded projects found.