Consider the following 3 processes, with the length of the CPU burst time given in milliseconds:
Process Arrival Time Burst Time P1 0 8 P2 1 4 P3 2 9
What is the average waiting time for these processes if they are scheduled using the preemptive shortest-job-first (shortest-remaining-time-first) scheduling algorithm?
| Process | Arrival Time | Burst Time |
|---|---|---|
| P1 | 0 | 8 |
| P2 | 1 | 4 |
| P3 | 2 | 9 |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. (B) 4.66
More System Software and Operating System questions
- Assuming that the system call fork() never fails, consider the following C programs P1 and P2 executed on a UNIX/Linux system. P1 P2 int ma…
- Consider the following four processes with the arrival time and length of CPU burst given in milliseconds: Process Arrival Time Burst Time…
- Which module gives control of the CPU to the process selected by the short-term scheduler?
- A fair share scheduler computes the priority of a process based on which of the following? (1) Processor utilization by the individual proc…
- Which of the following CPU scheduling algorithms may cause starvation of a process? (1) First-Come-First-Served (2) Round Robin (3) Priorit…
- A scheduling algorithm assigns a process's priority proportional to how long it has been waiting; every process starts at priority zero (th…