Mapping workflows onto grid resources within an SLA context

Authors:
Dang Minh Quan;Odej Kao
Affiliations:
Department of Computer Science, University of Paderborn, Germany;Department of Computer Science, University of Paderborn, Germany
Venue:
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
Year:
2005

Citing 4
Cited 8

Algorithms for constraint-satisfaction problems: a survey

AI Magazine
GridFlow: Workflow Management for Grid Computing

CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
PDDL2.1: an extension to PDDL for expressing temporal planning domains

Journal of Artificial Intelligence Research
Approach by localization and multiobjective evolutionaryoptimization for flexible job-shop scheduling problems

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews

Error recovery mechanism for grid-based workflow within SLA context

International Journal of High Performance Computing and Networking
A recovery mechanism for errors caused by a late subjob in a system handling SLA-based Grid workflows

International Journal of Web and Grid Services
Mapping Heavy Communication Grid-Based Workflows Onto Grid Resources Within an SLA Context Using Metaheuristics

International Journal of High Performance Computing Applications
Mapping heavy communication workflows onto grid resources within an SLA context

HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
SLA negotiation protocol for grid-based workflows

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Budget-Deadline constrained workflow planning for admission control in market-oriented environments

GECON'11 Proceedings of the 8th international conference on Economics of Grids, Clouds, Systems, and Services
Business model and the policy of mapping light communication grid-based workflow within the SLA Context

HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Budget-Deadline Constrained Workflow Planning for Admission Control

Journal of Grid Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The mapping of workflows on Grid resources differs from mapping a single job, as dependencies between the subjobs has to be considered and resolved. This is a major task, if underlying Service Level Agreements (SLAs) have to be satisfied, which define the deadline for the entire workflow but also allow flexibility while assigning the subjobs to resources. Therefore, new requirements regarding selection of optimal resource destination and satisfying multiple time constraints are important issues, which are not completely addressed by existing methods. This paper presents a method which performs an efficient and precise assignment of workflow subjobs to Grid resources with respect to SLAs and subjob dependencies. The quality of the created results is evaluated with a number of experiments and compared to the results of existing planning tools.