Hardware Reference
In-Depth Information
Exercises
8.1
Given the task set reported in the table, verify whether it is schedulable by the
Rate-Monotonic algorithm in non-preemptive mode.
C
i
T
i
D
i
τ
1
2
6
5
τ
2
2
8
6
τ
3
4
15
12
8.2
Given the task set reported in the table, verify whether it is schedulable by the
Rate-Monotonic algorithm in non-preemptive mode.
C
i
T
i
D
i
τ
1
3
8
6
τ
2
3
9
8
τ
3
3
14
12
τ
4
2
80
80
8.3
Given the task set reported in the table, compute for each task
τ
i
the longest
(floating) non-preemptive region
Q
i
that guarantees the schedulability under
EDF. Perform the computation using the Liu and Layland test.
C
i
T
i
τ
1
2
8
τ
2
2
10
τ
3
5
30
τ
4
5
60
τ
5
3
90
8.4
For the same task set reported in Exercise 8.3, compute for each task
τ
i
the
longest (floating) non-preemptive region
Q
i
that guarantees the schedulability
under Rate Monotonic. Perform the computation using the Liu and Layland
test.
Search WWH ::
Custom Search