Partitioned real-time scheduling on heterogeneous shared-memory multiprocessors

We consider several real-time scheduling problems on heterogeneous multiprocessor platforms, in which the different processors share a common memory pool. These include (i)~scheduling a collection of implicit-deadline sporadic tasks with the objective of meeting all deadlines; and (ii)~scheduling a collection of independent jobs with the objective of minimizing the makespan of the schedule. Both these problems are intractable (NP-hard). For each, we derive polynomial-time algorithms for solving them approximately, and show that these algorithms have bounded deviation from optimal behavior. We also consider the problem of determining how much common memory a platform needs in order to be able to accommodate a specified real-time workload.


Presented at:
23rd Euromicro Conference on Real-Time Systems (ECRTS2011), Porto, Portugal, July 6th - 8th, 2011
Year:
2011
Keywords:
Laboratories:




 Record created 2011-03-28, last modified 2018-09-13

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)