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

5.3 Consider two periodic tasks with computation times C 1 =1, C 2 =2and

periods T 1 =5, T 2 =8, handled by Rate Monotonic. Show the schedule
produced by a Polling Server, having maximum utilization and intermediate
priority, on the following aperiodic jobs:

a i C i

J 1 2 3

J 2 7 1

J 3 17 1

5.4 Solve the same scheduling problem described in Exercise 5.3, with a Sporadic

Server having maximum utilization and intermediate priority.

5.5 Solve the same scheduling problem described in Exercise 5.3, with a Deferrable

Server having maximum utilization and highest priority.

5.6 Using a Sporadic Server with capacity C s =2and period T s =5, schedule the

following tasks:

aperiodic tasks
a i

periodic tasks
C i

C i

T i

J 1 2 2

τ 1 1 4

J 2

5 1

τ 2 2 6

J 3 10 2