HP defines an SQL-like language to specify organizational policies (or constraints) in workflow systems. Three types of policies were studied including qualification, requirements and substitution policies which can n...HP defines an SQL-like language to specify organizational policies (or constraints) in workflow systems. Three types of policies were studied including qualification, requirements and substitution policies which can not handle complex role resolution such as Separation of Roles and Binding of Roles, and several exception situations, such as Role Delegation and Role Unavailable. From the perspective of project-oriented workflow, a project and its sub-projects can be under the charge of teams (or virtual teams). The teams should satisfy the role resolution of the projects managed by the team. To support the above requirements, based on team-enabled organization model, this paper extended HP’s policy language to support the role resolution in project-oriented workflow, and provided its modeling and enforcement mechanism.展开更多
The conventional deadline and budget constrained （DBC） scheduling heuristics for economic-based computational grids does not take the inconsistency of grid heterogeneity into account, which can lead to decline of ap...The conventional deadline and budget constrained （DBC） scheduling heuristics for economic-based computational grids does not take the inconsistency of grid heterogeneity into account, which can lead to decline of application completion ratios. Motivated by this fact, a novel DI3C scheduling heuristics was proposed to deal with sequential workflow applications. In order to valuate the inconsistency, the relative cost （RC） metric was introduced, which was used to indicate the task-starving degree for resources. The new algorithm assigns tasks to resources, considering completion time, budget and RC together. The GridSim toolkit and the benchmark suites of the standard performance evaluation corporation （SPEC） were used to simulate the heterogeneous grid environment and applications. The experimental results show that the task and workflow completion ratios of the new heuristics are higher than those of the conventional heuristics.展开更多
In order to reduce the scheduling makespan of a workflow,three list scheduling algorithms,namely,level and out-degree earliest-finish-time(LOEFT),level heterogeneous selection value(LHSV),and heterogeneous priority ea...In order to reduce the scheduling makespan of a workflow,three list scheduling algorithms,namely,level and out-degree earliest-finish-time(LOEFT),level heterogeneous selection value(LHSV),and heterogeneous priority earliest-finish-time(HPEFT)are proposed.The main idea hidden behind these algorithms is to adopt task depth,combined with task out-degree for the accurate analysis of task prioritization and precise processor allocation to achieve time optimization.Each algorithm is divided into three stages:task levelization,task prioritization,and processor allocation.In task levelization,the workflow is divided into several independent task sets on the basis of task depth.In task prioritization,the heterogeneous priority ranking value(HPRV)of the task is calculated using task out-degree,and a non-increasing ranking queue is generated on the basis of HPRV.In processor allocation,the sorted tasks are assigned one by one to the processor to minimize makespan and complete the task-processor mapping.Simulation experiments through practical applications and stochastic workflows confirm that the three algorithms can effectively shorten the workflow makespan,and the LOEFT algorithm performs the best,and it can be concluded that task depth combined with out-degree is an effective means of reducing completion time.展开更多
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 g...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.展开更多
文摘HP defines an SQL-like language to specify organizational policies (or constraints) in workflow systems. Three types of policies were studied including qualification, requirements and substitution policies which can not handle complex role resolution such as Separation of Roles and Binding of Roles, and several exception situations, such as Role Delegation and Role Unavailable. From the perspective of project-oriented workflow, a project and its sub-projects can be under the charge of teams (or virtual teams). The teams should satisfy the role resolution of the projects managed by the team. To support the above requirements, based on team-enabled organization model, this paper extended HP’s policy language to support the role resolution in project-oriented workflow, and provided its modeling and enforcement mechanism.
基金Project(60873107) supported by the National Natural Science Foundation of China
文摘The conventional deadline and budget constrained （DBC） scheduling heuristics for economic-based computational grids does not take the inconsistency of grid heterogeneity into account, which can lead to decline of application completion ratios. Motivated by this fact, a novel DI3C scheduling heuristics was proposed to deal with sequential workflow applications. In order to valuate the inconsistency, the relative cost （RC） metric was introduced, which was used to indicate the task-starving degree for resources. The new algorithm assigns tasks to resources, considering completion time, budget and RC together. The GridSim toolkit and the benchmark suites of the standard performance evaluation corporation （SPEC） were used to simulate the heterogeneous grid environment and applications. The experimental results show that the task and workflow completion ratios of the new heuristics are higher than those of the conventional heuristics.
基金The Natural Science Foundation of Hunan Province(No.2018JJ2153)the Scientific Research Fund of Hunan Provincial Education Department(No.18B356)+1 种基金the Foundation of the Research Center of Hunan Emergency Communication Engineering Technology(No.2018TP2022)the Innovation Foundation for Postgraduate of the Hunan Institute of Science and Technology(No.YCX2018A06).
文摘In order to reduce the scheduling makespan of a workflow,three list scheduling algorithms,namely,level and out-degree earliest-finish-time(LOEFT),level heterogeneous selection value(LHSV),and heterogeneous priority earliest-finish-time(HPEFT)are proposed.The main idea hidden behind these algorithms is to adopt task depth,combined with task out-degree for the accurate analysis of task prioritization and precise processor allocation to achieve time optimization.Each algorithm is divided into three stages:task levelization,task prioritization,and processor allocation.In task levelization,the workflow is divided into several independent task sets on the basis of task depth.In task prioritization,the heterogeneous priority ranking value(HPRV)of the task is calculated using task out-degree,and a non-increasing ranking queue is generated on the basis of HPRV.In processor allocation,the sorted tasks are assigned one by one to the processor to minimize makespan and complete the task-processor mapping.Simulation experiments through practical applications and stochastic workflows confirm that the three algorithms can effectively shorten the workflow makespan,and the LOEFT algorithm performs the best,and it can be concluded that task depth combined with out-degree is an effective means of reducing completion time.
基金the National Natural Science Foundation of China (No.60573141, 70271050)the Natural Science Foundation of Jiangsu Province (No.BK2005146)+3 种基金the High Technology Research Programme of Jiangsu Prov-ince (No.BG2005037, BG2005038, BG2006001)the High Technology Research Programme of Nanjing (No. 2006RZ105)the Foundation of National Laboratory for Modern Communications (No.9140C1101010603)the Key Laboratory of Information Technology Processing of Jiangsu Province (No.kjs05001, kjs0606).
文摘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.
