Hardware Reference
In-Depth Information
Algorithm: EDD
L
max
(
J
)
{
L
max
=
ā
D
n
;
f
0
=0;
for
(each
J
i
āJ
{
f
i
=
f
iā
1
+
C
i
;
L
i
=
f
i
+
D
i
;
if
(
L
i
>L
max
)
L
max
=
L
i
;
return(
L
max
);
)
}
Figure 13.1
Algorithm for finding the maximum lateness of a task set scheduled by EDD.
6
6
6
8
1
2
3
4
12
8
8
3
3
2
1
2
4
14
10
2
2
1
4
16
1
4
Figure 13.2
Scheduling tree constructed by the Bratley's algorithm for the task set shown
in Table 13.2.
3.5
The precedence graph is shown in Figure 13.3.
By applying the transformation algorithm by Chetto and Chetto, we get the
parameters shown in Table 13.3.
So the schedule produced by EDF will be
{
B
,
A
,
D
,
C
,
E
,
F
,
G
}
.
Search WWH ::
Custom Search