] > Scheduling feasibility, Processor <processor> cpua </processor> : - The base period is 10 (see [1], page 6). - 7 units of time are unused in the base period. - Processor utilization factor with deadline is 0.30000 (see [1], page 6). - Processor utilization factor with period is 0.30000 (see [1], page 6). - In the preemptive case, tasks are schedulable if processor utilization factor with period is equal or less than 0.82843 (see [1], page 16, theorem 8). - Tasks response time : (see [2], page 3, equation 4). T1 => 3 T2 => 2 Scheduling simulation, Processor <processor> cpua </processor> : - Number of preemption : 0 - Tasks response time : (from simulation) T1 => 1 T2 => 3 Set priorities, Processor <processor>cpua </processor> : - Set priorities according to Deadline Monotonic. - Updated priorities : T1 => 1 T2 => 2 End to end response time, Processor <processor>cpua</processor> : - Compute all steps (see [2], page 3, equation 4). - Tasks response time : T1 => 3, Jitter= 0 T2 => 6, Jitter= 4 Blocking time , Processor <processor>edf0 </processor> : - Computed blocking time : T5 => 0 (see [3]). T4 => 0 (see [3]). - Task blocking times are updated. Bound on buffers, Processor <processor>cpu-rm </processor> : - Computed buffer bounds : B1 => 4 (see [4], page 3, theorem 1).