Practice - Scheduling For the following list of jobs, (job id, admission time, r

Question

Practice - Scheduling

For the following list of jobs, (job id, admission time, required CPU time), assume a shortest-job-first schedule is used to determine the ordering of all none-running jobs. Each jobs is run to completion before a new job is started and context switches incur no overhead (i.e., take zero time). The jobs are: (A, 0, 16), (B, 0, 6+), (C, 2, 14), (D, 3, 8), (E, 4, 4), (F, 6, 1) For this scenario please described: The order of execution. The job completion rate. The average time spent waiting for the CPU.

Explanation / Answer

A

B

A

C

A

C

D

A

C

D

B

A

C

D

B

E

A

C

D

B

A

C

D

A

C

A

Order of the execution: B -> E -> F -> E -> B -> D -> C -> A
Job completion rate: 51/6 = 8.5 CPU time unit per job
The avarage time:
(finishing time - required CPU time - admission time)
(51 - 16 - 0) + (13 - 6 - 0) + (35 - 14 - 2) + (21 - 8 - 13) + (9 - 4 - 4) + (7 - 1 -6)
= 10.33

Time 0 2 3 4 6 7 9 13 21 35 51 Running Job B B B E F E B D C A Arriving Job

A

B

C D E F Queue A

A

C

A

C

D

A

C

D

B

A

C

D

B

E

A

C

D

B

A

C

D

A

C

A

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.