Hardware Reference
In-Depth Information
Exercises
9.1
For the set of two aperiodic jobs reported in the table, compute the instanta-
neous load for all instants in [0,8].
r
i
C
i
D
i
J
1
3
3
5
J
2
0
5
10
9.2
Verify the schedulability under EDF of the set of skippable tasks illustrated in
the table:
C
i
T
i
S
i
τ
1
2
5
∞
τ
2
2
6
4
τ
3
4
8
5
9.3
A resource reservation mechanism achieves temporal isolation by providing
service using the following periodic time partition, in every window of 10 units:
{
. This means that the service is only provided in the three
intervals indicated in the set and repeats every 10 units. Illustrate the resulting
supply function
Z
(
t
) and compute the (
α
, Δ) parameters of the corresponding
bounded delay function.
[0,2], [5,6], [8,9]
}
9.4
Consider the set of elastic tasks illustrated in the table, to be scheduled by EDF:
T
min
i
T
max
i
C
i
E
i
τ
1
9
15
30
1
τ
2
16
20
40
3
Since the task set is not feasible with the minimum periods, compute the new
periods
T
i
that make the task set feasible with a total utilization
U
d
=1.
9.5
Considering the same periodic task set of the previous exercise, compute the
new periods
T
i
resulting by applying a period rescaling (hence, not using the
elastic coefficients).
Search WWH ::
Custom Search