New Heuristic for Scheduling of Independent Tasks in Computational Grid
The Scheduling of tasks on heterogeneous grid resources is known to be a NP-complete problem; therefore, to get a near optimal solution within finite duration, heuristics/meta-heuristics are used for task scheduling instead of exact optimization methods. In this paper, the authors proposed a new heuristic method for scheduling of independent tasks on heterogeneous grid resources and compared the result with ten other scheduling heuristics. Benchmark instances of Expected Time to Complete (ETC) model, suggested by Braun are used to test the proposed heuristic. New heuristics give best Makespan as well as Flow-time values under much prevalent consistent resource and task heterogeneity conditions.