A Group Based Time Quantum Round Robin Algorithm Using Min-Max Spread Measure

Round Robin (RR) Scheduling is the basis of time sharing environment. It is the combination of First Come First Served (FCFS) scheduling algorithm and preemption among processes. It is basically used in a time sharing operating system. It switches from one process to another process in a time interval. The time interval or Time Quantum (TQ) is fixed for all available processes. So, the larger process suffers from Context Switches (CS). To increase efficiency, the authors have to select different TQ for processes. The main objective of RR is to reduce the CS, maximize the utilization of CPU and minimize the turn around and the waiting time. In this paper, they have considered different TQ for a group of processes.

Provided by: International Journal of Computer Applications Topic: Software Date Added: Feb 2013 Format: PDF

Find By Topic