Finding Best Time Quantum for Round Robin Scheduling Algorithm to avoid Frequent Context Switch

fastened then processes area unit scheduled specified no process get CPU time quite only once quantum in one go. If time quantum is simply too massive, the time interval of the processes is too much which cannot be tolerated in interactive atmosphere. If time quantum is simply too little, it causes unnecessarily frequent context switch resulting in more overheads leading to less throughput. During this paper, a technique using integer programming has been projected to resolve equations that decide a price that’s neither too large nor too little such that each method has affordable time interval and the throughput of the system isn’t attenuated as a result of unnecessarily context switche