| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 256.65 KB | Adobe PDF |
Advisor(s)
Abstract(s)
No abstract (2 page paper) Parallel real-time tasks can be assigned into a multiprocessor system in many different ways, with regards to the schedulability
of the task system. In the best case a parallel task may be completely parallelized, i.e., when the platform has a number of
processors no smaller than the degree of parallelism of the task and the interference from higher priority tasks does not
compromise its parallel behaviour; in the worst-case (considering the parallelism) the task needs to be completely serialized.
This latter scenario requires the adjustment of the timing properties of the parallel task so that the worst-case parallel behaviour
is considered in the analysis in order to avoid missing any deadlines. Moreover, this scenario is very pessimistic with respect
to the parallel structure of the task. Considering parallelism and real-time, it is important to achieve a good trade-off between
timing guarantees and the parallel execution of tasks so that efficient execution of such tasks may be possible
Description
6th Real-Time Scheduling Open Problems Seminar (RTSOPS 2015), Lund, Sweden.