Example of round robin scheduling

Answer 1

example on round robin problem in OS:

let here p1,p2,p3,p4 are some process and its burst time is given as:

P1=6

P2=8

P3=2

P4=4

time quantum=4 millisec

PROCESSES P1 P2 P3 P4 P1 P2

CPU CYCLES 0 4 8 10 14 16 20

SO in this example, a process cannot exceed more than 4 millisec. so each process is not exceeding more than 4 millisec. as p1 starting time is 0 ms and ending time is 4 ms then another process started at this time which also complete 4 cycles then another process p3 start which need only 2 cycles to complete its execution ,so goes only 2 cycles and finish its execution at time 14 and p4 complete its execution at 14 . now dis process will again started until all the process does not complete its execution remaining in the time quantum limit.