372 views
2 votes
2 votes

The Following processes are being scheduled using a Premptive RR scheduling Alogrithm. Each Process is Assigned a numeric Proirity, with higher number indicating higher priority. In addition it also has ideal task which consumes no CPU Resources and is identified by Pidle. This task has Priority 0 and is scheduled whenever the system has no other process to run. The length of time Quantum = 10 units.If a process is prempted by a higher priority process,the prempted process is placed at the end of queue.

           Thread               Priority           Burst            Arrival
              P1               40               20                 0
              P2               30               25                 25
              P3               30               25                 30
              P4               35               15                 60
              P5                5               10                100    
              P6               10               10                105

A. Turn Around Time of Each Process ?

B. Waiting time of Each Process ?

C. CPU Utilization Rate ?

1 Answer

0 votes
0 votes
RR scheduling is simply FCFS with preemption added. The preemption occurs on the basis of quantum. No matter what the priority the processes will be preempted once the time quantum is over and put at the end of a queue. The process at the start of the queue is brought up for execution next.

Related questions

0 votes
0 votes
1 answer
1
0 votes
0 votes
1 answer
2
Nam14 asked Apr 5, 2023
514 views
Please read below passage from 10th edition Operating System Concepts, pg. 202:5.1.3 Preemptive and Nonpreemptive SchedulingCPU-scheduling decisions may take place under ...
1 votes
1 votes
1 answer
3
FaisalSyed asked Mar 16, 2023
285 views
Does Waiting Time and Response TIme remains the same in Preemptive Scheduling Algorithm???