↑ Real Time Systems: Notes |
(in priority order)
The exam questions on Sporadic Server will be designed in a way that should permit answers based on any of the variants discussed in the text.
However, if in doubt, please try to preserve the fundamental property that the servers should not be able to cause any greater interference for lower priority tasks than would a periodic task with periodi ps and execution time es.
See the newly updated notes on sporadic servers, and the example below, for more information.
The following are diagrams showing solutions to various parts of exercise 7.1 in Jane Liu's text. The sporadic server examples are for my own sporadic server variant given in the web notes, under "How to Correct the Definition?".
Note that whenever the system is idle we can replenish all sporadic server budgets. This is safe because in our analysis of schedulabililty we can focus on just one busy interval at a time.
In this examle I assume that the sporadic server stats at time zero, and so its replenishments occur at times 2.5, 5, 7.5, 10, etc.
In the case indicated by "*" the normal replenishment coincides with an idle point, so that replenishment could be classified either way.
Note that because we are using RM priorities, the priority of the server drops below that of the task with period 2.5, now that the server has period 3.
© 2006 T. P. Baker ($Id: wk10t.html,v 1.1 2008/08/25 11:18:48 baker Exp $) |