Question

Question 9.1 from the textbook. Consider the following workload: Process Burst Time Priority Arrival Time P1 50 4 0 P2 20 1 20 P3 100 3 40 P4 40 2 60 Show the schedule using shortest remaining time, non-preemptive priority (a smaller number implies higher priority) and round robin with quantum 30, Make each entry in your answer equal to 10 time units. For example if your algorithm was FCFS then your answer would be: P1 P1 P1 P1 P1 P2 P2 P3 P3 P3 P3 P3 P3 P3 P3 P3 P3 P4 P4 P4 P4

Answer 1

Step-by-step explanation:

The schedule using shortest remaining time, non-preemptive priority and round Robin with quantum number 30 is shown in the attached file, please kindly go through it to access the answer.