]> <scheduling_feasibility> <title>Scheduling feasibility, Processor <processor>processor1</processor> : 1) Feasibility test based on the processor utilization factor : - The base period is 10 (see [18], page 5). - 5 units of time are unused in the base period. - Processor utilization factor with deadline is 0.50000 (see [1], page 6). - Processor utilization factor with period is 0.50000 (see [1], page 6). - In the preemptive case, with RM, the task set is schedulable because the processor utilization factor 0.50000 is equal or less than 1.00000 (see [19], page 13). 2) Feasibility test based on worst case task response time : - Bound on task response time : (see [2], page 3, equation 4). T1 => 5 T2 => 4 T3 => 2 - All task deadlines will be met : the task set is schedulable. <scheduling_feasibility> <title>Scheduling feasibility, Processor <processor>processor2</processor> : 1) Feasibility test based on the processor utilization factor : - The base period is 10 (see [18], page 5). - 6 units of time are unused in the base period. - Processor utilization factor with deadline is 0.40000 (see [1], page 6). - Processor utilization factor with period is 0.40000 (see [1], page 6). - In the preemptive case, with RM, the task set is schedulable because the processor utilization factor 0.40000 is equal or less than 1.00000 (see [19], page 13). 2) Feasibility test based on worst case task response time : - Bound on task response time : (see [2], page 3, equation 4). T4 => 4 - All task deadlines will be met : the task set is schedulable.