How does the round robin algorithm work?

Answer 1

There is a Queue of processes that need to work on and each process has it's time requirement to complete,

eg:

process processor time

A 3

B 8

C 6

D 4

if the processor give 1 processor time to each process , then A->B->C->D will run each taking 1 processor time and complete a cycle and each process that is not complete will add to the end of the queue, if a process is completed it will remove from the queue(not enqueueing).

This process will continue until all the process are completed and the queue is empty.

Above que will work as follows.

A->B->C->D->A->B->C->D->A->B->C->D>B->C->D->B->C->B->C->B->B-> Que is empty

in each highlighted position process that complete their process time remove from the queue and therefore the rest are processing according to queue.