ece351_hw2

# ece351_hw2 - following figure according to this priority...

This preview shows pages 1–2. Sign up to view the full content.

ECE 3510, Assignment #2 Due: Fri, Oct.30, 2009 1. The feasible interval of each job in the precedence graph in Figure 4P-1 is given next to its name. The execution time of all jobs is equal to 1. (a) Find the effective release times and deadlines of the jobs in the precedence graph in Figure 4P-1. (b) Find an EDF schedule of the jobs. (c) 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 J 3 , J 6 , and J 9 are at level 0, jobs J 2 and J 8 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

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: following figure according to this priority assignment. 2. A system T contains four periodic tasks, (8, 1), (15, 3), (20, 4), and (22, 6). Its total utilization is 0.87. Construct the initial segment in the time interval (0, 50) of a rate-monotonic schedule of the system. 3. Which of the following systems of periodic tasks are schedulable by the rate-monotonic algorithm? By the earliest-deadline-first algorithm? Explain you answer. (a) T = {(8, 3), (9, 3), (15, 3)} (b) T = {(8, 4), (12, 4), (20, 4)} J 1 (0, 10) J 2 (1, 4) J 3 (0, 5) J 4 (1, 6) J 5 (3, 9) J 6 (2, 10) J 7 (1, 12) J 8 (1, 12) J 9 (1, 12) (c) T = {(8, 4), (10, 2), (12, 3)}...
View Full Document

{[ snackBarMessage ]}

### Page1 / 2

ece351_hw2 - following figure according to this priority...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online