Hardware Reference
In-Depth Information
excellent
good
poor
computational
complexity
memory
requirement
implementation
performance
complexity
BKG
DPE
DSS
TBS
EDL
IPE
TB*
CBS
Figure 6.23
Evaluation summary of dynamic-priority servers.
Figure 6.23 provides a qualitative evaluation of the algorithms presented in this chapter
in terms of performance, computational complexity, memory requirement, and imple-
mentation complexity.
Exercises
6.1
Compute the maximum processor utilization that can be assigned to a Dynamic
Sporadic Server to guarantee the following periodic tasks, under EDF:
C
i
T
i
τ
1
2
6
τ
2
3
9
Search WWH ::
Custom Search