EKT 424: REAL-TIME SYSTEM ASSIGNMENT 1 : Chapter 1 to Chapter 4 Total Marks: 60 + 40 (Report + Idea Presentation)

Due Date: 12/03/2012 (GROUP SUBMISSION) Question 1. Consider the real-time program described by the pseudo code below. Names of the jobs are in italic and bold.
At 9AM, Start: have breakfast [15M] and go to office; At 10AM, If there is class, Teach [1H]; Else Help [1H] students; When Teach or Help is done, Eat_lunch [30M]; Until 1:30PM, Sleep; Complete Pray at 2:00PM and go for seminar. If there is a seminar, If topic is interesting, Listen [1H]; Else Read [1H]; Else Write [1H] in office; When seminar is over, Attend social hour[1H]; Discuss [30M]; Jog[1H]; Eat_dinner [30M]; Work a little more[1H]; End_the_day.

a) Draw a task graph to capture the dependencies among jobs. [Marks 6] b) Use as many precedence graphs as needed to represent all possible paths of the program. [Marks 6] c) Schedule all the jobs into 1, 2, and 3 processor(s); and justify the optimal solution. [Marks 2+3+3+2=10]

Page 1 of 2

Question 2: The task diagram below shows a set of jobs with the feasible interval for each listed next to the job name. The arrows in the diagram indicate the precedence relations between the jobs. The execution time of all jobs are equal to 1.

a) Calculate the effective release times and deadlines of the jobs. [Marks 3+3=6] b) Sketch the new task diagram. [Marks 3] c) Demonstrate whether they can be scheduled using the EDF algorithm. [Marks 9] d) A job is said to be at level i if the length of the longest path from the job to jobs that have no successors is i. So, jobs J3, J6 and J9 are at level 0, jobs J2, J5, and J8 are at level 1, and so on. Suppose that the priorities of the jobs are assigned based on their levels: the higher the level, the higher the priority. Find a priority-driven schedule of the jobs in the Figure 2 according to this priority assignment. i) Preemptive [Marks 10]

ii) Nonpreemptive [Marks 10]

Page 2 of 2