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

C T i

i

Server

τ

1 4

1

C

s = 2

τ

2 6

2

T = 5

s

τ 1

τ 2

aperiodic
requests

2 1 2 1

0 2 4 6 8 10 12 14 16 18 20 22 24

C

s

2

1

0 2 4 6 8 10 12 14 16 18 20 22 24

Figure 5.7 Example of a Deferrable Server scheduled by RM.

C T i

i

Server

τ

2 8

1

C = 2

s

τ

3 10

2

T = 6

s

τ 1

τ

2

aperiodic
requests

2 1 2 1

0 2 4 6 8 10 12 14 16 18 20 22 24

C s

2
1

0 2 4 6 8 10 12 14 16 18 20 22 24

Figure 5.8 Example of high-priority Deferrable Server.