APERIODIC TASK SCHEDULING - Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications - page 57

J J J J J

1 2 3 4 5

C 1 1 1 32

i

d 3 10 7 8 5

i

d d d d d

1 5 3 4 2

J J 5 J J J

L = L = -1

1 3 4 2

max 4

t

0 1 2 3 4 5 6 7 8 9 10

Figure 3.2 A feasible schedule produced by Jackson's algorithm.

J J J J J

1 2 3 4 5

C 12 1 4 2

i

d 2 5 4 8 6

i

d d d d d

1 3 2 5 4

J J J J J

L = L = 2

1 3 2 5 4

max 4

t

0 1 2 3 4 5 6 7 8 9 10

Figure 3.3 An infeasible schedule produced by Jackson's algorithm.