Affiliation:
1. Jawaharlal Nehru University, India
Abstract
Scheduling a job on the grid is an NP Hard problem, and hence a number of models on optimizing one or other characteristic parameters have been proposed in the literature. It is expected from a computational grid to complete the job quickly in most reliable grid environment owing to the number of participants in the grid and the scarcity of the resources available. Genetic algorithm is an effective tool in solving problems that requires sub-optimal solutions and finds uses in multi-objective optimization problems. This paper addresses a multi-objective optimization problem by introducing a scheduling model for a modular job on a computational grid with a dual objective, minimizing the turnaround time and maximizing the reliability of the job execution using NSGA – II, a GA variant. The cost of execution on a node is measured on the basis of the node characteristics, the job attributes and the network properties. Simulation study and a comparison of the results with other similar models reveal the effectiveness of the model.
Subject
General Earth and Planetary Sciences,General Environmental Science
Reference45 articles.
1. Aggarwal, M., Kent, R. D., & Ngom, A. (2005). Genetic Algorithm Based Scheduler for Computational Grids. In Proceedings of the Nineteenth International Symposium on High Performance Computing Systems and Applications (HPCS’05) (pp. 209-215). Washington, DC: IEEE.
2. Aggrawal, M., & Aggrawal, A. (2006). A Unified Scheduling Algorithm for Grid Applications. In Proceedings of the International Symposium on High Performance Computing in an Advanced Colloborative Environment (HPCS’06) (pp. 1-7).
3. Multiobjective genetic algorithms applied to solve optimization problems
4. Amaki, H., Kita, H., & Kobayashi, S. (1996). Multi-Objective Optimization By Genetic Algorithms: A Review. In Proceedings of IEEE International Conference on Evolutionary Computation (pp. 517-522).
5. An updated survey of GA-based multiobjective optimization techniques
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献