Utilization Bound Scheduling Analysis for Nonpreemptive Uniprocessor Architecture Using UML-RT
Table 1
Notations and description.
Notations used
Description
A task set
Total number of tasks in
Highest priority task
Lowest priority task
A task in task set
Computation time of
Interrelease time or period of
Problem area of the task , analyzed for schedulability. A necessary condition for the deadline miss to occur for is that the worst-case work load, () in the problem area by all other tasks in the task set except is no less than .
Computation time lesser than
Nonzero computation time
Task utilization of
System load
Set of all higher priority tasks of
Set of all lower priority tasks of
Set of all computation times of hp
Set of all computation times of lp
Maximum computation time in the subset of
Summation of computation times of all higher priorities of
Summation of computation times of all equal and higher priorities of
Summation of computation times of lower priorities of
Summation of computation times of equal and lower priorities of
Set of all computation times of hp
Set of all computation times of lp
Summation of all the task utilization of hp
Summation of equal and all task utilization of lp
th release time of
()th release time of and deadline for the task released at
Latest feasible start time for released at , to start execution in order to meet its deadline.
Number of intermediate tasks in
Work done by initial job, intermediate job or final job in
Worst-case latency of . It is the maximum time lapse for a task to start execute.
()
Total work done by other tasks in the problem area of
