Optimizing the Execution Time of the SLA-Based Workflow in the Grid with Parallel Processing Technology

Service Level Agreements (SLAs) is currently one of the major research topics in Grid Computing. Among many system components for the supporting of SLA-aware Gridbased workflow, the SLA mapping module receives important positions. Optimizing execution time is an important task of the mapping module as it helps in finding out a feasible solution when the Grid is busy or by eliminating the negative effects of the error. With the previously proposed algorithm for optimizing the execution time of the workflow, the mapping module may, when many requests come in a short period of time, become the bottleneck of the system. This paper presents a parallel mapping algorithm for optimizing the execution time of the workflow, which can cope with the problem. Performance measurements deliver evaluation results on the quality of the method

Mapping Light Communication SLA-Based Workflows onto Grid Resources with Parallel Processing Technology

Service Level Agreements (SLAs) are currently one of the major research topics in Grid Computing. Amongmany system components for supporting of SLA-aware Grid-based workflows, the SLA mapping module receives an important position. Mapping light communication workflows is one main part of the mapping module. With the previously proposed mapping algorithm, the mapping module may become the bottleneck of the system when many requests come in a short period of time. This paper presents a parallel mapping algorithm for light communication SLA-based workflows, which can cope with the problem. Performance measurements deliver evaluation results on the quality of the method

Mapping a Group of Jobs in the Error Recovery of a the Grid-Based Workflow within SLA Context

The error recovery mechanism receives an important position in the system supporting Service Level Agree- ments (SLAs) for the Grid-based work ow. If one sub-job of the work ow is late, a group of directly aected sub-jobs should be re-mapped in a way that does not aect the start time of other sub-jobs in the work ow and is as inexpen- sive as possible. With the distinguished workload and re- source characteristics as well as the goal of the problem, this problem needs new method to be solved. This paper presents a mapping algorithm, which can cope with the problem. Performance measurements deliver good evalu- ation results on the quality and eciency of the metho

Mapping Heavy Communication SLA-based Workflows onto Grid Resources with Parallel Processing Technology

Service Level Agreements (SLAs) are currently one of the major research topics in Grid Computing. Amongmany system components for supporting of SLA-aware Grid jobs, the SLA mapping module holds an important position and the capability of the mapping module depends on the runtime of the mapping algorithm. With the previously proposed mapping algorithm, the mapping module may develop into the bottleneck of the system if many requests come in during a short period of time. This paper presents a parallel mapping algorithm to map heavy communication SLA-based workflow onto Grid resources which can cope with the problem. Performance measurements thereby deliver evaluation results showing the quality of the method

Replicated execution of workflows

Workflows are the de facto standard for managing and optimizing business processes. Workflows allow businesses to automate interactions between business locations and partners residing anywhere on the planet. This, however, requires the workflows to be executed in a distributed and dynamic environment, where device and communication failures occur quite frequently. In case that a workflow execution becomes unavailable through such failures, the business operations that rely on the workflow might be hindered or even stopped, implying the loss of money. Consequently, availability is a key concern when using workflows in dynamic environments. In this thesis, we propose replication schemes for workflow engines to ensure the availability of the workflows that are executed by these engines. Of course, a workflow that is executed by a replicated workflow engine has to yield the same result as a non-replicated execution of that workflow. To this end, we formally define the equivalence of a replicated and a non-replicated execution called Single-Execution-Equivalence. Subsequently, we present replication schemes for both imperative and declarative workflow languages. Imperative workflow languages, such as the Web Service Business Process Execution Language (WS-BPEL), specify the execution order of activities through an ordering relation and are the predominant way of specifying workflow models. We implement a proof-of-concept for demonstrating the compatibility of our replication schemes with current (imperative) workflow technology. Declarative workflow languages provide greater flexibility by allowing the reordering of the activities within a workflow at run-time. We exploit this by executing differently ordered replicas on several nodes in the network for improving availability further

Copyright © 2007 Inderscience Enterprises Ltd. Error recovery mechanism for grid-based workflow within SLA context

Service Level Agreements (SLAs), as stated by Sahai et al. (2003), are currently one of the major research topics in grid computing, as they serve as a foundation for reliable and predictable job execution at remote grid sites. SLAs ar