Hello, I need help with this question. Can anyone assist me? Thanks. Recall that

Question

Hello, I need help with this question. Can anyone assist me? Thanks.

Recall that Shortest Remaining Job First (SRJF) is a variant of Shortest Job First (SJF) with preemption added in. Consider the following three processes vying for the CPU. The scheduler uses SRJF. The scheduler re-evaluates which process to run only upon the arrival of a new process into the scheduling queue, or the completion of a process. The table shows the arrival time of each process. Arrival Time 14 To2 ms lu ms Execution Time P1 P3 The scheduling starts at time To. Fill in the table below with the process that is executing on the processor during ms each time slot. Be sure to show your work as to how you arrived at schedule. Tthi

Explanation / Answer

At time To only P1 is there in the scheduling queue so it will execute until others come in

Now, Execution Times left are

P1 = 3 , P2=4 , P3=1

Now P2 has arrived but still P1 has less remaining time so it will run

P3 has arrived now.

Now, Execution Times left are

P1 = 2 , P2=4 , P3=1

Now, P1 will run because it has least Execution time.

Completing the table:

To+ 0 1 Running P1 P1

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---

---

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