Question: Given a task set t l , t 2 , . ., t k to be scheduled on a single processor, where t i =(C
Given a task set tl, t2, . ., tk to be scheduled on a single processor, where ti=(Ci,Ti), Ci is the worst case execution time and Ti is the period of ti (assume the deadline is equal to its period). Let U=C1/T1 + C2/T2 + + Ck/Tk. Prove that this task cannot be scheduled by any scheduling policy if U > 1.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
