A metaheuristic approach to scheduling workflow jobs on a Grid

Authors:
Marek Mika;Grzegorz Waligóra;Jan Weglarz
Affiliations:
Institute of Computing Science, Poznan´ University of Technology;Institute of Computing Science, Poznan´ University of Technology;Institute of Computing Science, Poznan´ University of Technology and Poznan´ Supercomputing and Networking Center
Venue:
Grid resource management
Year:
2004

Citing 0
Cited 5

Towards a general model of the multi-criteria workflow scheduling on the grid

Future Generation Computer Systems
Robust scheduler for grid networks under uncertainties of both application demands and resource availability

Computer Networks: The International Journal of Computer and Telecommunications Networking
Modelling and solving grid resource allocation problem with network resources for workflow applications

Journal of Scheduling
Dynamic job scheduling on the grid environment using the great deluge algorithm

PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Self Adaptive Particle Swarm Optimization for Efficient Virtual Machine Provisioning in Cloud

International Journal of Intelligent Information Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this chapter we consider the problem of scheduling workflow jobs on a Grid. This problem consists in assigning Grid resources to tasks of a workflow job across multiple administrative domains in such a way that minimizes the execution time of a particular set of tasks. The considered problem is formulated as a multi-mode resource-constrained project scheduling problem with schedule-dependent setup times, which is an extension of the classical resource-constrained project scheduling problem to minimize the makespan (RCPSP). We present a binary linear programming (0-1 LP) formulation of the problem, and propose a local search metaheuristic approach to solve the considered problem.