Determining the Optimum Time Quantum Value in Round Robin Process Scheduling Method
Shahram Saeidi, Hakimeh Alemi Baktash · International Journal of Information Technology and Computer Science · 2012
The process scheduling, is one of the most important tasks of the operating system.One of the most common scheduling algorith ms used by the most operating systems is the Round Robin method in wh ich, the ready processes waiting in ready queue, seize the processor for a short period of time known as the quantum (or time slice) circularly.In this paper, a nonlinear p rogramming mathematical model is developed to determine the optimu m value of the time quantum, in order to min imize the average waiting t ime o f the processes.The model is implemented and solved by Lingo 8.0 software on four selected problems fro m the literature.