Task Scheduling Optimization in Global Grid Using a Hybrid Metaheuristic Algorithm Based on Genetic and Colonial Competitive Algorithms

Task Scheduling Optimization in Global Grid Using a Hybrid Metaheuristic Algorithm Based on Genetic and Colonial Competitive Algorithms

Sobhan Esmaeili1 Zohreh Bateni2 Kooroush Manochehri3

1) MS Student of IT, Computer Networks, Islamic Azad University Central Tehran Branch, Iran Email:
2) Assistant Professor of Computer Engineering and IT, Islamic Azad University Central Tehran Branch, Iran Email:
3) Assistant Professor of Computer Engineering and IT, Islamic Azad University Parand Branch, Iran Email:

IOI Code : XYGD-BCHBG
Publication : The 5th International conference of Sciences and Engineering(5icesconf.com)
Abstract :
    To run users applications, global grid use a large number of dynamic, distributed and heterogeneous resources that are controlled and supervised by various organizations. Here, task scheduling becomes an NP-complete problem despite limitations imposed by users to the system (namely cost and time deadlines). Therefore, considering that metaheuristic algorithms are highly efficient to solve NP-complete problems, in this study, while investigating various scheduling algorithms proposed recently in this regard, we have attempted to suggest a scheme that provides us with benefits including reduced time complexity of search and its easy implementation by combining meta heuristic genetic and colonial competitive algorithms. Results of simulation conducted in a fair environment using MATLAB simulation tool showed that compared to other algorithms presented recently related to task scheduling in global grid, the proposed algorithm prevents premature convergence and a pause in local minimums and it ensures global optimality while improving task scheduling.

Keywords : global grid task scheduling metaheuristic algorithms genetic algorithm