Sciweavers

Share
DATE
2009
IEEE

Robust non-preemptive hard real-time scheduling for clustered multicore platforms

9 years 7 months ago
Robust non-preemptive hard real-time scheduling for clustered multicore platforms
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiprocessor System-on-chip (MPSoC) platforms. In this work we focus on an off-line (design-time) version of this problem, where the target task graph is known before execution time. We address the issue of scheduling robustness, i.e. providing hard guarantees that the schedule will meet the end-to-end deadline in presence of bounded variations of task execution times expressed as min-max intervals known at design time. We present a robust scheduling algorithm that proactively inserts sequencing constraints when they are needed to ensure that execution will have no inserted idle times and will meet the deadline for any possible combination of task execution times within the specified intervals. The algorithm is complete, i.e. it will return a feasible graph augmentation if one exists. Moreover, we provide an optimiz...
Michele Lombardi, Michela Milano, Luca Benini
Added 20 May 2010
Updated 20 May 2010
Type Conference
Year 2009
Where DATE
Authors Michele Lombardi, Michela Milano, Luca Benini
Comments (0)
books