Question
Recall that Shortest Remaining Time First (SRTF) is a variant of Shortest Job First (SJF) with preemption added in. Consider the following three processes for
Recall that Shortest Remaining Time First (SRTF) is a variant of Shortest Job First (SJF) with preemption added in. Consider the following three processes
for the CPU. The scheduler uses SRTF. 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.
process | arrival time | execution time |
p1 | to | 5ms |
p2 | to + 2ms | 4ms |
p3 | to = 3ms | 1ms |
The scheduling starts at time T0.
Fill up the blank cell/cells in the table below with the appropriate time information.
A)At time T0:
process | remanining time |
p1 | |
p2 | not arrived yet |
p3 | not arrived yet |
B)At time T0 + 2 ms : (Process P2 arrives)
process | remaining time |
p1 | |
p2 | |
p3 | not arrived |
C). At time T0 + 3 ms: (Process P3 arrives)
process | reamining time |
p1 | |
p2 | |
p3 |
D).Fill in the table below with the process that is executing on the processor during each time slot (the first slot has been filled up with Process P1)
interval TO | oms | 1 ms | 2 ms | 3MS | 4ms | 5ms | 6ms | 7ms | 8ms |
running process | p1 |
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started