Improving Scheduling Criteria of Preemptive Tasks Scheduled under Round Robin Algorithm using Changeable Time QuantumSamih M. Mostafa1*, Safwat H. Hamad2 and S. Z. Rida1
- *Corresponding Author:
- Dr. Samih M. Mostafa
Faculty of Science Mathematics
Department South Valley University
E-mail: [email protected]
Received date: March 28, 2011; Accepted date: November 06, 2011; Published date: November 11, 2011
Citation: Mostafa SM, Hamad SH, Rida SZ (2011) Improving Scheduling Criteria of Preemptive Tasks Scheduled under Round Robin Algorithm using Changeable Time Quantum. J Comput Sci Syst Biol 4:071-076. doi:10.4172/jcsb.1000078
Copyright: © 2011 Mostafa SM, et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Problem statement: In Round Robin Scheduling the time quantum is fixed and then processes are scheduled such that no process get CPU time more than one time quantum in one go. If time quantum is too large, the response time of the processes is too much which may not be tolerated in interactive environment. If time quantum is too small, it causes unnecessarily frequent context switch leading to more overheads resulting in less throughput. In this paper a method using changeable time quantum has been proposed that decides a value that is neither too large nor too small such that this value gives the beast scheduling criteria and every process has got reasonable response time and the throughput of the system is not decreased due to unnecessarily context switches.