Grid Workflow Model Research Articles

Petri net based Grid workflow verification and optimization

Graphical workflow modeling tools, such as UML and DAG, can facilitate users to express workflow process logic, but lack of abilities to carry out simulation and correctness checking. In this paper, based on Petri net, we propose a service composition oriented Grid workflow model and its related six elementary workflow patterns: sequence, condition, iteration, concurrency, synchronization, and triggering. In addition, we present our Grid workflow analysis approaches on three aspects: workflow reachability verification, workflow deadlock verification, and workflow optimization. The experimental results show that our workflow verification and optimization mechanisms are feasible and efficient.

A Formal Modeling Method for Grid Workflow Based on Concurrent Transaction Logic

Grid workflow is an important means to implement the cooperation of resources in the grid and becomes a key alternative to develop truly distributed applications for the grid platform. Grid workflow modeling is the basis of the establishment and execution of workflows. However, it is a challenging task for grid workflow modeling, due to the high degree of autonomy and heterogeneity of the cooperative organizations under distributed environments. Recently, Concurrent TRansaction logic (CTR) has become one of the most exciting methods for grid process modeling. In this paper, we present our current work for the modeling and controlling execution of grid workflow by CTR technique. We describe in detail the syntax of modeling method and summarize special communication primitives from which any process can be defined and understood by their interactive behaviors. The proposed method can provide some new functions like implementing comprehensive coordination and cooperation behaviors of different business processes to improve the stability of grid workflow system. Experimental results show that the proposed method works well for characterizing the behaviors and interactions of the workflow processes under heterogeneous environments in terms of the semantics of CTR.

A scheduling model for temporally constrained grid workflow for distributed simulation system on grid

PurposeIn the grid‐based simulation, the resource application needed is distributed in the grid environment as grid service, and time management is a key problem in the simulation system. Grid workflow provides convenience for grid user to management and executes grid services. But it emphasizes process and no time‐management, so a temporally constrained grid workflow model is pointed out based on grid flow with temporally constraint to schedule resources and manage time.Design/methodology/approachThe temporally constrained grid workflow model is distributed model: the federate has local temporal constraints and interactive temporal constraints among federates. The problem to manage time is a temporally distributed constraint satisfaction problem given deadline time and duration time of grid services. Multi‐asynchronous weak‐commitment search (AWS) algorithm is an approach to resolve DCSP, so a practical example of a simulation project‐based grid system was presented to introduce application of Multi‐AWS algorithm.FindingsThe temporally constrained grid workflow is based temporal reasoning and grid workflow description about grid services.Originality/valueThe new problem about scheduling resources and managing time in the grid‐based simulation is pointed out; and the approach to resolve the problem is applied into a practical example.

DAGMap: efficient and dependable scheduling of DAG workflow job in Grid

DAG has been extensively used in Grid workflow modeling. Since Grid resources tend to be heterogeneous and dynamic, efficient and dependable workflow job scheduling becomes essential. It poses great challenges to achieve minimum job accomplishing time and high resource utilization efficiency, while providing fault tolerance. Based on list scheduling and group scheduling, in this paper, we propose a novel scheduling heuristic called DAGMap. DAGMap consists of two phases, namely Static Mapping and Dependable Execution. Four salient features of DAGMap are: (1) Task grouping is based on dependency relationships and task upward priority; (2) Critical tasks are scheduled first; (3) Min-Min and Max-Min selective scheduling are used for independent tasks; and (4) Checkpoint server with cooperative checkpointing is designed for dependable execution. The experimental results show that DAGMap can achieve better performance than other previous algorithms in terms of speedup, efficiency, and dependability.

Manufacturing Grid Workflow Framework and Model

The Manufacturing Grid domain is characterized by rapid and substantial change over time. The entire process of product development can be quite complex. The activities are expected to be executed on heterogeneous resources which are geographically distributed. However, traditional modeling systems use static workflow models which can not automatically redesign the business process and mask the isomerism of the resources. In this article, an open and extensible framework of MG workflow is given, which complies with the standard of WFMC and GGF. A formalized definition workflow model is proposed including process model, organization model, resource model, and service mode. The integrated workflow model can be used to dynamically represent a business process and other aspect s of Manufacturing Grid workflow.

A hybrid petri-net model of grid workflow

In order to effectively control the random tasks submitted and executed in grid workflow, a grid workflow model based on hybrid petri-net is presented. This model is composed of random petri-net, colored petri-net and general petri-net. Therein random petri-net declares the relationship between the number of grid users’ random tasks and the size of service window and computes the server intensity of grid system. Colored petri-net sets different color for places with grid services and provides the valid interfaces for grid resource allocation and task scheduling. The experiment indicated that the model presented in this letter could compute the valve between the number of users’ random tasks and the size of grid service window in grid workflow management system.

QoS-Awared Grid Workflow Schedule

QoS allows for the selection and execution of Grid workflow to better fulfill customer's expections. Introducing of QoS can provide means for schedule of component services and make the execution of workflow satisfy the requirements of users better. The estimate algorithms of QoS and QoS-awared workflow schedule are two basic problems of workflow QoS management. In this paper, the QoS parameters of grid workflow are discussed, the corresponding QoS estimate algorithms are presented based on a Grid workflow model, and the problem of QoS-awared gird workflow schedule is proposed. Some QoS-awared schedule algorithms are discussed