A hyper-heuristic approach for resource provisioning-based scheduling in grid environment

Grid computing being immensely based on the concept of resource sharing has always been closely associated with a lot many challenges. Growth of Resource provisioning-based scheduling in large-scale distributed environments like Grid computing brings in new requirement challenges that are not being considered in traditional distributed computing environments. Resources being the backbone of the system, their efficient management plays quite an important role in its execution environment. Many constraints such as heterogeneity and dynamic nature of resources need to be taken care as steps toward managing Grid resources efficiently. The most important challenge in Grids being the job–resource mapping as per the users’ requirement in the most secure way. The mapping of the jobs to appropriate resources for execution of the applications in Grid computing is found to be an NP-complete problem. Novel algorithm is required to schedule the jobs on the resources to provide reduced execution time, increased security and reliability. The main aim of this paper is to present an efficient strategy for secure scheduling of jobs on appropriate resources. A novel particle swarm optimization-based hyper-heuristic resource scheduling algorithm has been designed and used to schedule jobs effectively on available resources without violating any of the security norms. Performance of the proposed algorithm has also been evaluated through the GridSim toolkit. We have compared our resource scheduling algorithm with existing common heuristic-based scheduling algorithms experimentally. The results thus obtained have shown a better performance by our algorithm than the existing algorithms, in terms of giving more reduced cost and makespan of user’s application being submitted to the Grids.