assigned a numerical priority, with a higher number indicating a higher relative priority. The scheduler will execute t
-
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling
algorithm .Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. The scheduler will execute the highest-priority process. For processes with the same priority, a round-robin scheduler will be used with a time quantum of 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue.
Fill in the multiple blanks.
a. What is the turnaround time for each process?
P1 = , P2= , P3 = , P4 = , P5 = , P6 =
b. What is the waiting time for each process?
P1 = , P2= , P3 = , P4 = , P5 = , P6 =
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
