Abstract—The computational grid provides a promising platform for the deployment of various high-performance computing applications. In computational grid, an efficient scheduling of task onto the processors that minimizes the entire execution time is vital for achieving a high performance.
Solving this problem is very hard and many attempts have been made to solve the problem. Using classical algorithms, With regard to the complexity of this problem, is not the good way; so the indefinite method acts better than classical method. Evolutionary algorithms are the best choice for solving this hard problem. In this paper, contrary to prior ways, the new string representation has been used, communication costs has not been ignored and presents as a major factor for reaching to optimum solution.

Index Terms—Grid Computing Systems, LGR, Genetic Algorithm, Scheduler

Nima Jafari Navimipour is with Islamic Azad University, Tabriz Branch, Tabriz, Iran, phone: +989144021694; fax: +984115552322; e-mail: Jafari@iaut.ac.ir and Jafari_n@ymail.com
Seyes Hasan Es-hagi is member of Young Researchers Club, Tabriz Branch, Islamic Azad University, Tabriz Branch, Tabriz, Iran, phone:+989143171845; fax: +984114201024; e-mail: es-hagi@iaut.ac.ir andes_hagi@gmail.com

Cite: Nima Jafari Navimipour and Seyed Hasan Es-hagi, "LGR: The New Genetic Based Scheduler for Grid Computing Systems," International Journal of Computer and Electrical Engineering vol. 1, no. 5, pp. 610-614, 2009.