Provably good task assignment on heterogeneous multiprocessor platforms for a restricted case but with a stronger adversary

Authors:
Gurulingesh Raravi;Björn Andersson;Konstantinos Bletsas
Affiliations:
CISTER-ISEP Research Center, Polytechnic Institute of Porto, Portugal;Carnegie Mellon University, Pittsburgh and CISTER-ISEP Research Center, Polytechnic Institute of Porto, Portugal;CISTER-ISEP Research Center, Polytechnic Institute of Porto, Portugal
Venue:
ACM SIGBED Review - Work-in-Progress (WiP) Session of the 23rd Euromicro Conference on Real-Time Systems (ECRTS 2011)
Year:
2011

Citing 5
Cited 1

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
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

Task assignment algorithms for two-type heterogeneous multiprocessors

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We consider a restricted case where the maximum utilization of any task on any processor in the system is no greater than one. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multi-processor platform and (re-)prove its performance guarantee for this restricted case but for a stronger adversary. We show 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.