The correct answer is: Sampling Period. So jobs are released at t = 5k where k = 0, 1, . The ratio u i = e i /p i is the utilization of the task T i.. U i i Question 3 The time T between any two consecutive sensor reading is called Select one: Sampling Period Response Time Turn around time Show Answer. In this paper, we propose a model where each selected period is not restricted to be a natural number, but can be any rational number within a range. What is the hyperperiod of 3 periodic tasks with periods 3,4 and 10 Select one: 60 17 120 Show Answer. Modelling Periodic Tasks •! The hyperperiod is H = lcm(20,28,93) = 13020. ., n . Let’s suppose three tasks whose periods are 20, 28 and 93. that is • = ( Tj = (ej.q); i=I •...•n ) where ej is the task execution time. Time after which the pattern of job release/execution times starts to repeat, limiting analysis needed •! we define the schedulability window. Example: –! types of tasks: periodic or non periodic o It is simple and works nicely in theory (+) o Simple schedulability test: U <= 1 (+) o Optimal (+) o Best CPU utilization (+) Difficult to implement in practice. So the job of this task is first released at t = 0 then it executes for 3s and then next job is released at t = 5 which executes for 3s and then next job is released at t = 10. Feedback Your answer is correct. Definition 3.1: Given a task system. to be executed on a single processor system with preemption allowed. T 1: p 1 = 3, e 1 = 1 –! This preview shows page 50 - 51 out of 148 pages.. for i=1, 2, …n. The length of a hyper period of three periodic tasks with periods 3, 4, 10 is 60 The maximum number N of jobs in each hyper period is equal to i=1 n H/pi. … The correct answer is: 60 . It is not very often adopted due to the dynamic priority-assignment (expensive to sort the ready queue on-line), which has nothing to do with the periods of tasks. The total number of job in the hyper period is 41. Feedback Your answer is correct. The hyper-period of a set of periodic tasks is the least common multiple of their periods: H = lcm(p i) for i = 1, 2, …, n –! consisting of n hyperperiodic tasks. Abstract: Task period selection is often used to adjust the workload to the available computational resources. . Hyper period of a set of periodic tasks is the least common multiple of periods of all the tasks in that set. and Q; is the task hyperperiod.