期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2013
卷号：10
期号：2
出版社：IJCSI Press
摘要：We model the objective function, that the jobs entering the scheduler have a Poissons distribution and the jobs that are sent out from the multilevel feedback scheduler are also distributed as a Poissons distribution. We also assume that the number of CPUs in a processing element is not restricted to one, but rather many CPUs integrated into one PE. Therefore, we assume the M/M/c queue model for our calculations. In Kendall\'s notation, we describes a system where arrivals form a single queue and are governed by a Poisson process, where there are c servers and job service times are exponentially distributed. Gridlets provided by the users are assigned to processing elements (PEs), and gridlets whose remaining service time is shifted between queues of the MLFQ scheduler to be completed. In MLFQ, the total architecture is divided into multiple prioritized queues. This approach provides gridlets which starve in the lower priority queue for long time to get resources. As a result, the response time of the starved gridlets decreases and overall turnaround time of the scheduling process decreases. This scheduling policy is simulated using Alea GridSim toolkit to test the performance. The proposed MLFQ scheduling algorithm works better in most of the scenarios when compared to FCFS and PBS_PRO algorithms.
