Comparative study of heuristic algorithms and Nature-inspired algorithms for scheduling in grid computing

Distributed systems have an important role in high performance computing. One of the major challenges in this field that has a significant impact on the performance of such systems is the scheduling. The problem of scheduling tasksin heterogeneous systems due to the need for better use of existing computing systems and less time to implementscheduling algorithms, the important. Scheduling problem for heterogeneous distributed computing systems, such asscheduling problems are NP-Complete, and yet numerous models and algorithms to optimize the scheduling problem in heterogeneous systems is presented. In this paper, some of the scheduling algorithms and compare performance of these algorithms in different environments are heterogeneous.

Keywords:

scheduling , distributed computing systems , scheduling algorithms , performance