#self doubt

Question

In round-robin if one process finishes its time quantum and at the same time another process enters the system so which one will enter the ready queue first?

Comments

I belief that depends on the implementation .

---

executing process come into first in ready queue

---

any standard source of your argument ?

Answer 1

@shivang1234

Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing...

As the term is generally used, time slices (also known as time quanta) are assigned to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive)....

Round-robin scheduling is simple, easy to implement, and starvation-free. Round-robin scheduling can be applied to other scheduling problems, such as data packet scheduling in computer networks. It is an operating system concept....

The name of the algorithm comes from the round-robin principle known from other fields, where each person takes an equal share of something in turn....

If the process terminates or changes its state to waiting during its attributed time quantum, the scheduler selects the first process in the ready queue to execute....

Round-robin algorithm is a pre-emptive algorithm as the scheduler forces the process out of the CPU once the time quota expires...

 

1. https://gateoverflow.in/143537/Context-switches-in-round-robin 

 

2. https://gateoverflow.in/129457/Round-robin-scheduling-algorithm 

 

3. https://gateoverflow.in/147415/Os-round-robin-scheduling 

 

4. https://en.wikipedia.org/wiki/Round-robin_scheduling

 

 

Answer 2

The new process which came after completion of first proces's  time quantum, will be the first in ready state .