Dynamic Time Quantum in Round Robin Algorithm (DTQRR) Depending on Burst and Arrival Time of the Processes

Provided by: International Journal of Innovative Technology and Exploring Engineering (IJITEE)
Topic:
Format: PDF
In multitasking and time sharing operating system the performance of the CPU depends on waiting time, response time, turnaround time, context switches from the process mainly depends on the scheduling algorithm. Round robin is most widely used scheduling algorithm but this algorithm has some disadvantages. Here time quantum play very impartment role. If the time quantum is too large then it works like FCFS (First Cum First Serve) scheduling algorithm and if time quantum is too small then more context switches is occur which decrease the performance of the CPU.

Find By Topic