Hardware Reference
In-Depth Information
7.3
Solve the same problem described in Exercise 7.2 when the resources are ac-
cessed by the Priority Ceiling Protocol.
7.4
For the task set described in Exercise 7.2, illustrate the situation produced by
RM + PIP in which task
τ
2
experiences its maximum blocking time.
7.5
Consider four periodic tasks
τ
1
,
τ
2
,
τ
3
, and
τ
4
(having decreasing priority) that
share five resources,
A
,
B
,
C
,
D
, and
E
, accessed using the Priority Inheritance
Protocol. Compute the maximum blocking time
B
i
for each task, knowing that
the longest duration
δ
i,R
for a task
τ
i
on resource
R
is given in the following
table (there are no nested critical sections):
A
B
C
D
E
τ
1
3
6
10
0
7
τ
2
0
0
8
0
0
τ
3
0
4
0
8
14
τ
4
7
0
9
0
11
7.6
Solve the same problem described in Exercise 7.5 when the resources are ac-
cessed by the Priority Ceiling Protocol.
7.7
For the task set described in Exercise 7.5, illustrate the situation produced by
RM + PIP in which task
τ
2
experiences its maximum blocking time.
7.8
Consider three tasks
τ
1
,
τ
2
, and
τ
3
that share three multi-unit resources,
A
,
B
,
and
C
, accessed using the Stack Resource Policy. Resources
A
and
B
have
three units, whereas
C
has two units. Compute the ceiling table for all the
resources based on the following task characteristics:
D
i
μ
A
μ
B
μ
C
τ
1
5
1
0
1
τ
2
10
2
1
2
τ
3
20
3
1
1
Search WWH ::
Custom Search