Skip Navigation
Open Access Research Database
International Journal of Scientific and Research Publications
Home Browse Resources Get Recommendations Forums About Help Advanced Search

Scheduling in Round Robin Using Dynamic Task Quantum

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.
Cumulative Rating: (not yet rated)
Creator
Publisher
Date Issued 2019-09-06
Resource Type
Format
Language
Source http://www.ijsrp.org/research-paper-0919.php?rp=P939156
Date Of Record Creation 2019-10-01 02:20:47
Date Of Record Release 2019-10-01 02:20:47
Date Last Modified 2019-10-01 02:20:47

Resource Comments

(no comments available yet for this resource)