FIXED-PRIORITY SERVERS - Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications - page 158

excellent good poor

computational
complexity

memory implementation

performance

requirement complexity

Background

Service

Polling

Server

Deferrable

Server

Priority
Exchange

Sporadic

Server

Slack

Stealer

Figure 5.26 Evaluation summary of fixed-priority servers.

for handling soft aperiodic requests in a hard real-time environment, all these factors
should be considered. Figure 5.26 provides a qualitative evaluation of the algorithms
presented in this chapter.

Exercises

5.1 Compute the best parameters that can be assigned to a Sporadic Server to guar-

antee the following periodic tasks under RM, while enhancing aperiodic re-
sponsiveness as much as possible:

C i T i

τ 1 1 6

τ 2 2 7

5.2 Compute the best parameters that can be assigned to a Deferrable Server to

guarantee the task set described in Exercise 5.1.