Академический Документы
Профессиональный Документы
Культура Документы
T1
< (1) = 0
T4 <(2) = {1}
T2 T3 <(3) = {1}
<(4) = {1}
<(5) = {1,2,3}
T5 T6
<(6) = {1,3,4}
T7 <(7) = {1,3,4,6}
<(8) = {1,3,4,6,7}
T8
d. Dynamic-priority
Assume that priority can change with
time
tasks
the prog
Complete the access to the protected object by
T1 T2
S2
T1 T2 T1 Task 1 deadline
Figure 5.2
S3
0 1 2 3 4 5 6 7 8 9
time
INB47302 Real Time System 19
Task Assignment/Scheduling
Characteristics
Ex: Consider a 2 task system. Let the release times of
tasks Ti and Tj be 1 and 2, respectively; the
deadlines be 7 and 5; and the execution
times/period be 3.25 and 2.
Explanation:
S1 meet both deadlines, however, suppose follow
the perfectly sensible policy of not keeping the
processor idle whenever there is a task waiting to
be run
S2 task S2 missing its deadline
S3 is a preemptive schedule. When T1 is
released, it starts executing. When T1 arrives, T2 is
preempted and run to completion, thus meeting its
deadline. Then T1 resumes from where it left off and
also meets its deadlineINB47302 Real Time System 20
Classical Uniprocessor Scheduling
Algorithms
Rate Monotonic Analysis
Rate Monotonic Scheduling Algorithm
It is a
uniprocessor static priority preemptive
scheme
Scheduling a set of tasks on a single
processor
procedure for assigning fixed priorities to
tasks to maximize their schedulability
A task set is considered schedulable if all
tasks meet all deadline all the time
Figure 5.3
Classical Uniprocessor Scheduling
Algorithms
Rate Monotonic Analysis
Rate Monotonic Scheduling Algorithm
Application
Refer to case study, the period of Task 1 is
shorter than the period of Task 2.
So, assign the higher priority to Task 1. This
corresponds to Case 1 in Figure 5.3, which is
the priority assignment that succeeded in
meeting all deadlines
Concepts