A Data Flow Optimization Based Approach for BPEL Processes Partition

Business agility usually requires dynamic business process management. For example, business process outsourcing (BPO), often needs partition an existing BPEL- described business process into a number of sub-processes, which can be run at different business partners' in a decentralized way. However, how to effectively partition BPEL processes is still a challenging issue. In this paper, we propose a data flow optimization based BPEL process partitioning approach. Firstly, the messages used in the BPEL processes are transformed into asynchronously transmitted variables. Then, the transformed BPEL process is represented as a parallel flow graph (PFG), and is optimized through data flow analysis. Finally, the business process is partitioned based on the optimized PFG. Experimental results have demonstrated that the workload of message transmission and the response time are all effectively reduced.

[1]  Mangala Gowri Nanda,et al.  Synchronization analysis for decentralizing composite Web services , 2003, SAC '03.

[2]  Vivek Sarkar,et al.  Decentralizing execution of composite web services , 2004, OOPSLA.

[3]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[4]  Sunil Chandra,et al.  Decentralized orchestration of composite web services , 2004, WWW Alt. '04.

[5]  Dirk Grunwald,et al.  Data flow equations for explicitly parallel programs , 1993, PPOPP '93.

[6]  Frank Leymann,et al.  E Role-based Decomposition of Business Processes using BPEL , 2006, 2006 IEEE International Conference on Web Services (ICWS'06).

[7]  David A. Padua,et al.  Basic compiler algorithms for parallel programs , 1999, PPoPP '99.

[8]  Mabo Robert Ito,et al.  Data flow analysis for parallel programs , 1993, CSC '93.