Three processes arrive as follows:
Process Arrival Time Burst Time P0 0 ms 7 ms P1 1 ms 3 ms P2 2 ms 7 ms
The preemptive shortest-job-first (SJF) scheduling algorithm is used, with scheduling decisions made only at a process arrival or completion. What is the average waiting time for the three processes?
| Process | Arrival Time | Burst Time |
|---|---|---|
| P0 | 0 ms | 7 ms |
| P1 | 1 ms | 3 ms |
| P2 | 2 ms | 7 ms |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. (B) 3.67 ms
More System Software and Operating System questions
- For the following set of processes scheduled using FCFS policy, determine the average waiting time. Assume that the processes arrived in th…
- Which of the following statements are true? (A) Shortest remaining time first scheduling may cause starvation. (B) Preemptive scheduling ma…
- An OS follows round robin scheduling with a time quantum of 4 ms. Assuming that the CPU is free now and there are 20 processes waiting in t…
- If an operating system does not allow a child process to exist when the parent process has been terminated, this phenomenon is called:
- 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…
- 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…