You are on page 1of 7

# CAP536 – Real Time Software and Systems HW-2

Homework Title / No. : ____2 Course Code : __CAP536 Course Instructor: ____Gargi sharma_ Student’s Roll No.____D3804A15__ Section No. : _____D3804 Declaration: I declare that this assignment is my individual work. I have not copied from any other student’s work or from any other source except where due acknowledgment is made explicitly in the text, nor has any part been written for me by another person. Student’s Signature: ___surendra__________ Evaluator’s comments: _____________________________________________________________________ Marks obtained: ___________ out of ______________________ Content of Homework should start from this page only:

Part-A

2. Identify the constraints that a set of periodic real time tasks need to satisfy for RMA to be an optical scheduler for the set of tasks? ANSWER: A set of periodic real-time tasks would not be RMA schedulable unless they satisfy the following necessary condition: n n i=1Σ ei / pi = i=1Σ ui ≤ 1 Where ei is the worst case execution time and pi is the period of the task Ti, n is the number of tasks to be scheduled, and ui is the CPU utilization due to the task Ti. This test simply expresses the fact that the total CPU utilization due to all the tasks in the task set should be less than 1.

A set of n real-time periodic tasks are schedulable under RMA, if n 1/n − 1) i=1Σ ui ≤ n(2 Where ui is the utilization due to task Ti. Let us now examine the implications of this result. If a set of tasks satisfies the sufficient condition, then it is guaranteed that the set of tasks would be RMA schedulable.

Part-B

4.

Is EDF algorithm used for scheduling real time tasks a dynamic priority scheduling algorithm? Does EDF compute any priority value of tasks any time? If you answer affirmatively, then explain when and how the priority is computed. If your answer negatively, explain the concept of priority in EDF. ANSWER: