基于谓词冲突图的死锁检测  

Deadlock testing based on predicte conflict graph

作　　者：龚卫华[1] 王元珍[1] 

机构地区：[1]华中科技大学计算机科学与技术学院,湖北武汉430074

出　　处：《华中科技大学学报（自然科学版）》2006年第5期26-29,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家信息产业部电子发展基金资助项目

摘　　要：在分布式多数据库环境下,局部站点数据库自治性使其只能对本地站点上事务进行并发控制而无法防止全局事务间的冲突和死锁发生,故采用谓词冲突检测技术来判断全局事务间的直接和间接冲突,为此,提出了多粒度的谓词冲突图构建方法,从而使并发控制粒度达到谓词级,分析了冲突的全局事务在谓词冲突图中形成死锁的各种情况并通过检测图中是否形成环来避免全局事务在执行中可能产生的死锁,不仅减小死锁冲突检测粒度,而且还提高了全局事务执行的并发度.A predicate testing technique was used to judge the direct or indirect conflicts among global transactions. A method was proposed to construct a predicate conflict graph with multiple grains to achieve predicate-level concurrency control. Analyzed the different cases that the conflict global transactions caused deadlocks in the predicate graph. The probability of deadlocks would be avoided, when an efficient way was to test if there existed a clique in the predicate conflict graph because of the direct and indirect conflicts between concurrent global transactions, which could reduce the granularity of deadlock testing and improve the concurrency degree of executing global transactions.

关 键 词：数据库系统 全局事务 间接冲突 死锁检测 谓词冲突图 

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