Scheduling algorithms are accountable for arranging submitted jobs to available resources in cloud environment to get maximum utilization of resources and minimum response time and latency. The recommended algorithm mainly pivot on two basic factors first is variable task quantum which provide balanced waiting time among long and short tasks. Second is divide the Main Queue of ready tasks in to two sub queues accordingly value of task quantum. Simulation of algorithm is done by using cloudsim toolkit 3.0.3 opposed three different scheduling algorithms shortest job first, Round Robin and Time slice priority based round robin.
Anoop Kaur, Yogesh Kumar (2019); Scheduling in Round Robin Using Dynamic Task Quantum; International Journal of Scientific and Research Publications (IJSRP)
9(9) (ISSN: 2250-3153), DOI: http://dx.doi.org/10.29322/IJSRP.9.09.2019.p93100