An operating system uses a Preemptive Priority scheduling algorithm. Consider the arrival time, priority (0 is the lowest) and CPU burst, I/O burst, another CPU burst. Assume that each process has its own I/O resource.
|
|
Burst time |
||||
|
Process |
Arrival Time |
Priority |
CPU |
I/O |
CPU |
|
P1 |
0 |
1 |
2 |
4 |
1 |
|
P2 |
1 |
2 |
2 |
5 |
3 |
|
P3 |
3 |
3 |
3 |
5 |
2 |
What is the finishing time of process P1?
1
11
2
13
3
14
4
15