An algorithm of automatic workflow optimization

Authors:
A. A. Kalenkova
Affiliations:
Dorodnicyn Computing Center, Russian Academy of Sciences, Moscow, Russia 119333
Venue:
Programming and Computing Software
Year:
2012

Citing 6
Cited 0

Optimizing compilers for modern architectures: a dependence-based approach

Optimizing compilers for modern architectures: a dependence-based approach
A Novel Graph Reduction Algorithm to Identify Structural Conflicts

HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Applying Propositional Logic to Workflow Verification

Information Technology and Management
Semi-Automatic Business Process Performance Optimization Based On Redundant Control Flow Detection

AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
PGWFT: a petri net based grid workflow verification and optimization toolkit

GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Application of if-conversion to verification and optimization of workflows

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers an algorithm of automatic workflow optimization that, unlike well-known redesign algorithms for workflows [1, 2], can analyze arbitrary structures containing conditional branches and cycles. This algorithm operates with workflows without structural conflicts and, in the course of operation, uses execution conditions obtained as a result of application of the Boolean verification algorithm (BVA) proposed earlier in [3]. A modified BVA is proposed and its computational complexity is estimated.