Scribd
Upload
22 views2 pages

تمرین اول (1)

The document outlines a series of tasks and questions related to sporadic and periodic job scheduling, including parameters for modeling, utilization comparisons, and scheduling strategies using EDF and priority-driven methods. It also discusses a system of non-preemptable jobs, their execution times, deadlines, and the impact of scheduling on multiple processors. Additionally, it addresses the feasibility of scheduling jobs with identical execution times on a single processor.

Uploaded by

mobinafakhimi7613
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views2 pages

تمرین اول (1)

The document outlines a series of tasks and questions related to sporadic and periodic job scheduling, including parameters for modeling, utilization comparisons, and scheduling strategies using EDF and priority-driven methods. It also discusses a system of non-preemptable jobs, their execution times, deadlines, and the impact of scheduling on multiple processors. Additionally, it addresses the feasibility of scheduling jobs with identical execution times on a single processor.

Uploaded by

mobinafakhimi7613
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Please send your answers to: [email protected].

ir
Email subject format: RTES_HW03_StutentNumber
Deadline:

3.1) Because sporadic jobs may have varying release times and execution times, the periodic
task model may be too inaccurate and can lead to unduly underutilization of the processor
even when the inter release times of jobs are bounded from below and their executions are
bounded from above. As an example, suppose we have a stream of sporadic jobs whose
inter release times are uniformly distributed from 9 to 11. Their execution times are
uniformly distributed from 1 to 3.
a) What are the parameters of the periodic task if we were to use such a task to model the
stream?
b) Compare the utilization of the periodic task in part (a) with the average utilization of the
sporadic job stream.

4.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 are equal to 1.
a) Find the effective release times and deadlines of the jobs in the precedence graph in
Figure4P–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 J3, J6, and J9 are at level 0, jobsJ2, 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 Figure 4P–1
according to this priority assignment.

4.5) A system contains nine non preemptable jobs named Ji, for i =1,2,...,9. Their execution
times are 3, 2, 2, 2, 4, 4, 4, 4, and 9, respectively, their release times are equal to 0, and their

1
deadlines are 12. J1 is the immediate predecessor of J9, and J4 is the immediate predecessor
of J5, J6, J7, and J8. There is no other precedence constraints. For all the jobs, Ji has a higher
priority than Jk if i<k.
a) Draw the precedence graph of the jobs.
b) Can the jobs meet their deadlines if they are scheduled on three processors? Explain your
answer.
c) Can the jobs meet their deadlines if we make them preemptable and schedule them
preemptively. Explain your answer.
d) Can the jobs meet their deadlines if they are scheduled non preemptively on four
processors? Explain your answer.
e) Suppose that due to an improvement of the three processors, the execution time of every
job is reduced by 1. Can the jobs meet their deadlines? Explain your answer.
4.7) Consider the set of jobs in Figure 4–3. Suppose that the jobs have identical execution
time.
a) What maximum execution time can the jobs have and still can be feasible scheduling on
one processor? Explain your answer.

You might also like