Fast multi-objective reschulding of grid jobs by heuristics and evolution

Authors:
Wilfried Jakob;Alexander Quinte;Karl-Uwe Stucky;Wolfgang Süß
Affiliations:
Karlsruhe Institute of Technology, Institute for Applied Computer Science, Karlsruhe, Germany;Karlsruhe Institute of Technology, Institute for Applied Computer Science, Karlsruhe, Germany;Karlsruhe Institute of Technology, Institute for Applied Computer Science, Karlsruhe, Germany;Karlsruhe Institute of Technology, Institute for Applied Computer Science, Karlsruhe, Germany
Venue:
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Year:
2009

Citing 7
Cited 0

Scheduling Algorithms

Scheduling Algorithms
Bi-criteria algorithm for scheduling jobs on cluster platforms

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
The Anatomy of the Grid: Enabling Scalable Virtual Organizations

International Journal of High Performance Computing Applications
Best compromise solution for a new multiobjective scheduling problem

Computers and Operations Research
Complex Scheduling (GOR-Publications)

Complex Scheduling (GOR-Publications)
Fast Multi-objective Scheduling of Jobs to Constrained Resources Using a Hybrid Evolutionary Algorithm

Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Tackling the grid job planning and resource allocation problem using a hybrid evolutionary algorithm

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scheduling of jobs to a computational grid is a permanent process due to the dynamic nature of the grid and the frequent arrival of new jobs. Thus, a permanent rescheduling of already planned and new jobs must be performed. This paper will continue and extend previous work, which focused on the tuning of our Global Optimising Resource Broker and Allocator GORBA in a static planning environment. A formal definition of the scheduling problem and a classification will be given. New heuristics for rescheduling exploiting the "old plan" will be introduced and it will be investigated how they contribute to the overall planning process. Furthermore, the maximal possible load, which can be handled within the given time frame of three minutes, will be examined for a grid of growing size of up to 6000 grid jobs and 600 resources.