计算机科学与系统生物学杂志

Improving Scheduling Criteria of Preemptive Tasks Scheduled under Round Robin Algorithm using Changeable Time Quantum

Abstract

Samih M. Mostafa, Safwat H. Hamad and S. Z. Rida

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.