An Improved Genetic Algorithm with Limited Iteration for Grid Scheduling
- 1 August 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. xii (21604908) , 221-227
- https://doi.org/10.1109/gcc.2007.42
Abstract
In grid environment the numbers of resources and tasks to be scheduled are usually variable. This kind of characteristics of grid makes the scheduling approach a complex optimization problem. Genetic algorithm (GA) has been widely used to solve these difficult NP-complete problems. However the conventional GA is too slow to be used in a realistic scheduling due to its time-consuming iteration. This paper presents an improved genetic algorithm for scheduling independent tasks in grid environment, which can increase search efficiency with limited number of iteration by improving the evolutionary process while meeting a feasible result.Keywords
This publication has 8 references indexed in Scilit:
- Providing Portlet-Based Client Access to CIMA-Enabled Crystallographic Instruments, Sensors, and DataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- The anatomy of the grid: enabling scalable virtual organizationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Adaptive grid job scheduling with genetic algorithmsFuture Generation Computer Systems, 2005
- Sub optimal scheduling in a GRID using genetic algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing SystemsJournal of Parallel and Distributed Computing, 1999
- Globus: a Metacomputing Infrastructure ToolkitThe International Journal of Supercomputer Applications and High Performance Computing, 1997
- Convergence analysis of canonical genetic algorithmsIEEE Transactions on Neural Networks, 1994
- A modified genetic algorithm for optimal control problemsComputers & Mathematics with Applications, 1992