Multiprocessor DSP Scheduling in System-on-a-chip Architectures
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Task Partitioning Upon Heterogeneous Multiprocessor Platforms
RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
Partitioning Real-Time Tasks among Heterogeneous Multiprocessors
ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
Feasibility Analysis of Preemptive Real-Time Systems upon Heterogeneous Multiprocessor Platforms
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Notional Processors: An Approach for Multiprocessor Scheduling
RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Timing Analysis of Concurrent Programs Running on Shared Cache Multi-Cores
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Provably good multiprocessor scheduling with resource sharing
Real-Time Systems
Assigning Real-Time Tasks on Heterogeneous Multiprocessors with Two Unrelated Types of Processors
RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Combining Abstract Interpretation with Model Checking for Timing Analysis of Multicore Software
RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Real-time scheduling with resource sharing on uniform multiprocessors
Proceedings of the 20th International Conference on Real-Time and Network Systems
| Hi-index | 0.00 |
Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform where a task may request at most one of $\left|R\right|$ shared resources. There are m1 processors of type-1 and m2 processors of type-2. Tasks may migrate only when requesting or releasing resources. We present a new algorithm, FF-3C-vpr, which offers a guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that only allows tasks to migrate when requesting or releasing a resource, then FF-3C-vpr also meets deadlines if given processors $2+ 3 \cdot \left\lceil \frac{|R|}{\min(m_1,m_2)}\right\rceil$ times as fast. As far as we know, it is the first result for resource sharing on heterogeneous platforms with provable performance.