An application-semantics-based relaxed transaction model for internetware  

作　　者：HUANG Tao DING Xiaoning WEI Jun 

机构地区：[1]Technology Center of Software Engineering, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China [2]Key laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing100080, China [3]Graduate School of Chinese Academy of Sciences, Beijing 100080, China

出　　处：《Science in China(Series F)》2006年第6期774-791,共18页中国科学（F辑英文版）

基　　金：This work was supported by the Major State Basic Research Development Program of China （973 Program） （Grant No. 2002CB312005）;the National Natural Science Foundation of China （Grant No. 60573126）.

摘　　要：An internetware application is composed by existing individual services, while transaction processing is a key mechanism to make the composition reliable. The existing research of transactional composite service （TCS） depends on the analysis to composition structure and exception handling mechanism in order to guarantee the relaxed atomicity. However, this approach cannot handle some application-specific requirements and causes lots of unnecessary failure recoveries or even aborts. In this paper, we propose a relaxed transaction model, including system mode, relaxed atomicity criterion, static checking algorithm and dynamic enforcement algorithm. Users are able to define different relaxed atomicity constraint for different TCS according to application-specific requirements, including acceptable configurations and the preference order. The checking algorithm determines whether the constraint can be guaranteed to be satisfied. The enforcement algorithm monitors the execution and performs transaction management work according to the constraint. Compared to the existing work, our approach can handle complex application requirements, avoid unnecessary failure recoveries and perform the transaction management work automatically.An internetware application is composed by existing individual services, while transaction processing is a key mechanism to make the composition reliable. The existing research of transactional composite service （TCS） depends on the analysis to composition structure and exception handling mechanism in order to guarantee the relaxed atomicity. However, this approach cannot handle some application-specific requirements and causes lots of unnecessary failure recoveries or even aborts. In this paper, we propose a relaxed transaction model, including system mode, relaxed atomicity criterion, static checking algorithm and dynamic enforcement algorithm. Users are able to define different relaxed atomicity constraint for different TCS according to application-specific requirements, including acceptable configurations and the preference order. The checking algorithm determines whether the constraint can be guaranteed to be satisfied. The enforcement algorithm monitors the execution and performs transaction management work according to the constraint. Compared to the existing work, our approach can handle complex application requirements, avoid unnecessary failure recoveries and perform the transaction management work automatically.

关 键 词：INTERNETWARE service composition relaxed atomicity relaxed transaction mode. 

分 类 号：TP393.09[自动化与计算机技术—计算机应用技术]