Article in Proceedings INPROC-2009-19

BibliographyDanylevych, Olha; Karastoyanova, Dimka; Leymann, Frank: Optimal Stratification of Transactions.
In: ICIW 2009.
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology.
english.
IEEE Computer Society, May 2009.
Article in Proceedings (Conference Paper).
CorporationICIW 2009
CR-SchemaH.4.1 (Office Automation)
Abstract

The performance of a system (implementing business processes) is directly influenced by the way its operations are split into transactions. Stratified transactions a produced by the stratification approach presented in this paper and is a way to manage a global transaction by combining the transactions coordinated using the tho-phase commit protocol (2PC) and queued transactions. In the presented stratification approach the sub-transactions are partitioned into the so-called strata which employ 2PC for transaction coordination, and the strata communicate via persistent queues. This paper investigates the mechanisms for building an optimally stratified transaction regarding certain evaluation criteria. We investigate the applicability of algorithms for local search like the hillclimbing and simulated annealing for transaction stratification, and introduce a hybrid method combining both approaches to tackle its disadvantage. We also used the population-based optimization approach (evolutionary programming). We produce recommendations for use of all the approaches depending on the optimization criteria. The approach can be applied for fragmenting workflow-based service compositions in an optimal manner and thus support the out-sourcing and insourcing scenarios.

Full text and
other links
ICIW 2009
Department(s)University of Stuttgart, Institute of Architecture of Application Systems
Project(s)S-Cube
Entry dateFebruary 6, 2009
   Publ. Institute   Publ. Computer Science