%0 Journal Article
%T A Scheduling Protocol for Transactional Workflows Based on Mix-Grained Conflict Detection<br>基于混合粒度冲突检测的事务工作流调度算法
%A DING Ke
%A WEI Jun
%A FENG Yu-Lin
%A <br>丁柯
%A 魏峻
%A 冯玉琳
%J 软件学报
%D 2003
%I 
%X A transactional workflow is composed of traditional flat transactions, and its execution has relaxed transactional atomicity. Due to different termination characteristics of transactions, only one workflow is allowed to execute non-compensatable transactions with current scheduling protocols. In this paper, two granularities of conflict based on transaction classes and transaction instances are defined, and a scheduling protocol by using both granularities of conflict detection is proposed. Besides generating serializable and recoverable schedules, this method provides a higher degree of concurrency in following two ways. On the one hand, the fine-grained locking mechanism based on transaction instances is used to reduce conflict possibility among concurrent workflows. On the other hand, the coarse-grained conflict mechanism based on transaction classes is used to predict future conflict among workflows, multiple workflows are therefore allowed to execute non-compensatable transactions if they will not conflict in predicated future execution.
%K transactional workflow
%K concurrency control
%K recovery
%K scheduling protocol
%K locking granularity<br>事务工作流
%K 并发控制
%K 恢复
%K 调度算法
%K 锁粒度
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=2ADE33EA670A3D57&yid=D43C4A19B2EE3C0A&vid=F3583C8E78166B9E&iid=38B194292C032A66&sid=F7BB24011DC0D223&eid=315A3D008C6ECFC8&journal_id=1000-9825&journal_name=软件学报&referenced_num=6&reference_num=12