Dynamic Task-Scheduling in Grid Computing using Prioritized Round Robin Algorithm
Over the years, grid computing has emerged as one of the most viable and scalable alternatives to high performance supercomputing, tapping into computing power of the order of Gigaflops. However, the inherent dynamicity in grid computing has made it extremely difficult to come up with near-optimal solutions to efficiently schedule tasks in grids. The present paper proposes a novel grid-scheduling heuristic that adaptively and dynamically schedules tasks without requiring any prior information on the workload of incoming tasks. The approach models the grid system in the form of a state-transition diagram, employing a prioritized round-robin algorithm with task replication to optimally schedule tasks, using prediction information on processor utilization of individual nodes. Simulations, comparing the proposed approach with the round-robin heuristic, have shown the given heuristic to be more effective in scheduling tasks as compared to the latter.
Keywords: Dynamic Scheduling, Grid Computing, Task Replica, Round Robin, Prioritized Round Robin, Prediction Information
Download Full-Text