I am given a list of processes with their arrival time, CPU, time and Priority. The time quantum is given as 2 seconds. A lower priority number translates to a higher priority.
(process #, arrival time, CPU time, Priority)
-P0: 0, 8, 5
-P1: 2, 2, 4
-P2: 4, 1, 6
-P3: 6, 3, 3
So the priority ranks P3,P1,P0, P4.
would my scheduling look like this using the priority non preemptive scheduling algorithm:
P0 P0 P0 P0 P0 P0 P0 P0 P3 P3 P3 P1 P1 P2
I wasn't able to figure this question out on my homework and I wasn't given the solution either. I wasn't sure if the time quantum would affect my scheduling or if I even am understanding the priority non-preemptive scheduling algorithm either.