A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary
Ref: HURRAY-TR-110502 Publication Date: 6 to 8, Jul, 2011
A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversaryRef: HURRAY-TR-110502 Publication Date: 6 to 8, Jul, 2011
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  (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.
23rd Euromicro Conference on Real-Time Systems (ECRTS'11), Work-In-Progress Session.
Record Date: 30, May, 2011
Short links for this page: www.cister.isep.pt/docs/hurray_tr_110502 www.cister.isep.pt/docs/619