Journal
REAL-TIME SYSTEMS
Volume 50, Issue 1, Pages 87-141Publisher
SPRINGER
DOI: 10.1007/s11241-013-9191-3
Keywords
Heterogeneous multiprocessors; Real-time scheduling; Resource augmentation bound
Categories
Funding
- National Funds through FCT (Portuguese Foundation for Science and Technology)
- ERDF (European Regional Development Fund) through COMPETE (Operational Programme 'Thematic Factors of Competitiveness') [FCOMP-01-0124-FEDER-022701, FCOMP-01-0124-FEDER-020447]
- National Funds through FCT
- EU ARTEMIS JU [333053]
- ERDF, through ON2-North Portugal Regional Operational Programme, under the National Strategic Reference Framework (NSRF) [NORTE-07-0124-FEDER-000063]
- Department of Defense [FA8721-05-C-0003]
Ask authors/readers for more resources
Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors-such a platform is referred to as two-type platform. We present two low degree polynomial time-complexity algorithms, SA and SA-P, each providing the following guarantee. For a given two-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then (i) using SA, it is guaranteed to find such an assignment where the same restriction on task migration applies but given a platform in which processors are times faster and (ii) SA-P succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which processors are 1+alpha times faster. The parameter 0
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
