Hardware Reference
In-Depth Information
case (a)
C 1 < T 2
- F T
1
τ
1
τ 2
0
F T
T 2
1
Figure 4.8
The second request of τ 2
is released when τ 1
is idle.
Case 2.
The computation time of τ 1 (synchronously activated with τ 2 ) is long
enough to overlap with the second request of τ 2 .
That is, C 1
T 2
FT 1 .
In this situation, depicted in Figure 4.9, the largest possible value of C 2 is
C 2 =( T 1
C 1 ) F,
and the corresponding upper bound U ub
is
C 1
T 1
+ C 2
T 2
C 1
T 1
+ ( T 1
C 1 ) F
T 2
U ub
=
=
=
T 1
T 2
F + C 1
C 1
T 2
=
T 1
F =
T 2
T 1
F .
T 1
T 2
F + C 1
T 2
=
(4.4)
Since the quantity in square brackets is positive, U ub
is monotonically increasing in
C 1 and, being C 1
T 2
FT 1 , the minimum of U ub
occurs for
C 1 = T 2
FT 1 .
In both cases, the minimum value of U ub occurs for
C 1 = T 2
T 1 F.
 
Search WWH ::




Custom Search