Hardware Reference
In-Depth Information
τ
1
τ
2
τ
3
0
2
4
6
8
10
12
14
16
18
20
22
24
Figure 13.4
Schedule produced by Rate Monotonic for the task set of Exercise 4.1.
4.2
The processor utilization factor of the task set is
3
5
+
1
8
+
1
10
=0
.
825
,
which is greater than
U
lub
(3). Hence, we cannot verify the feasibility with the
Liu and Layland test. Using the Hyperbolic Bound, we have the following:
n
U
=
(
U
i
+1)=1
.
98
,
i
=1
which is less than 2. Hence, we can conclude that the task set is schedulable
by RM, as shown in Figure 13.5.
τ
1
τ
2
τ
3
0
2
4
6
8
10
12
14
16
18
20
22
24
Figure 13.5
Schedule produced by Rate Monotonic for the task set of Exercise 4.2.
4.3
Applying the Liu and Layland test we have
1
4
+
2
6
+
3
10
=0
.
88
>
0
.
78
,
so we cannot conclude anything. With the Hyperbolic Bound we have
n
U
=
(
U
i
+1)=2
.
16
>
2
i
=1
Search WWH ::
Custom Search