May 24, 2009 to May 28, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICIW.2009.79
The performance of applications is influenced by the way its operations are grouped into global transactions. This in turns influences the performance of business processes which utilize these applications as implementations of process activities/steps. Stratified transactions, as produced by the stratification approach presented in this paper, is a way to manage a global transaction by combining the more elemental transactions coordinated using the two-phase commit protocol and queued transactions. The stratification approach can be applied for optimally fragmenting workflowbased service compositions and support the out- and insourcing scenarios. This paper formally models global transactions and investigates the mechanisms for building an optimally stratified transaction relying on formally defined evaluation criteria. We investigate the applicability of local search algorithms to the optimization of transaction stratification. In particular we consider hill-climbing, simulated annealing, and a novel hybrid method combining both approaches.
Olha Danylevych, Dimka Karastoyanova, Frank Leymann, "Optimal Stratification of Transactions", ICIW, 2009, Internet and Web Applications and Services, International Conference on, Internet and Web Applications and Services, International Conference on 2009, pp. 493-498, doi:10.1109/ICIW.2009.79