Cooperative Grid Jobs Scheduling with Multi-objective Genetic Algorithm

Job scheduling on computational grids is a key problem in large scale grid-based applications for solving complex problems. The aim is to obtain an efficient scheduler able to allocate dependable jobs originated from large scale applications on hierarchy based grid computing platforms with heterogeneous resources. In contrast to satisfying multi objectives of different levels, which is NP-hard in most formulations, a set of cooperative multi-objective genetic algorithm (MOGA) is presented. Using this scheme, the application level generates multiple local schedules based on local nodes and objectives to a schedule pool, from which the system level can assemble a set of global schedules according to global objectives. The MOGA scheduling scheme is shown to perform well on the experimental scenario, which shows its flexibility and possible application to more complex job scheduling scenarios with multiple and diverse tasks and nodes.

[1]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[2]  Chuliang Weng,et al.  Heuristic scheduling for bag-of-tasks applications in combination with QoS in the computational grid , 2005, Future Gener. Comput. Syst..

[3]  Jarek Nabrzyski,et al.  User preference driven multiobjective resource management in grid environments , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[4]  Thilo Kielmann,et al.  Proceedings. 19th IEEE International Parallel and Distributed Processing Symposium , 2005 .

[5]  Marco Mililotti,et al.  Sub optimal scheduling in a grid using genetic algorithms , 2004, Parallel Comput..

[6]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[7]  Atakan Dogan,et al.  On QoS-based scheduling of a meta-task with multiple QoS demands in heterogeneous computing , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[8]  Joel H. Saltz,et al.  Performance optimization for data intensive grid applications , 2001, Proceedings Third Annual International Workshop on Active Middleware Services.

[9]  Nathan W. Brixius,et al.  Solving large-scale quadratic assignment problems , 2000 .

[10]  Jeff T. Linderoth,et al.  Solving large quadratic assignment problems on computational grids , 2002, Math. Program..

[11]  Anthony A. Maciejewski,et al.  Static mapping heuristics for tasks with dependencies, priorities, deadlines, and multiple versions in heterogeneous environments , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[12]  Vincenzo Di Martino,et al.  Sub optimal scheduling in a grid using genetic algorithms , 2003, Parallel Comput..

[13]  Atakan Dogan,et al.  A comparison of static QoS-based scheduling heuristics for a meta-task with multiple QoS dimensions in heterogeneous computing , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[14]  Andrew J. Page,et al.  Dynamic task scheduling using genetic algorithms for heterogeneous distributed computing , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.