实时数据库中的可推测并发控制算法  

The Speculative Concurrency Control Algorithm in Real-Time Databases

作　　者：罗琼[1] 张立臣[1] 

机构地区：[1]广东工业大学计算机学院,广州510090

出　　处：《计算机科学》2004年第10期87-92,181,共7页Computer Science

基　　金：国家自然科学基金(No.60174050);广东省自然科学基金(No.010059);教育部骨干教师基金; 广东省"千百十"工程人才培养基金;广 东省教育厅科研基金支持

摘　　要：可推测并发控制是一种新的并发控制方法,特别适合于实时数据库系统。可推测并发控制使用潜在冗余计算以确保尽可能早地发现和采纳可串行化调度,因而增加满足严格时间限制备件的实时性。本文中,首先阐述了基于SCC类算法的家庭成员SCC-nS算法。接着讨论了根据要求资源量的3个SCC-nS算法和它们执行的推测级别。最后,提供了建立可推测和实时性的一些模拟结果。Speculative Concurrency Control (SCC)is a new concurrency control approach, especially suited for realtime database systems. SCC uses potentially redundant computations to ensure the serializable schedules are discovered and adopted as early as possible, thus increasing the likelihood of the timely commitment of transactions with strict timing constraints. In the paper, first we illustrate SCC-nS, a generic algorithm that characterizes a family of SCC-based algorithms. Then single out three SCC-nS family members, which differ in the amount of resources they require, and thus the level of speculation they perform. Finally, we provide some simulation results that establish the correlation between speculation and timeliness.

关 键 词：并发控制算法 实时性 实时数据库系统 可串行化 冗余计算 调度 SCC 制方 严格 发现 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论] TP391[自动化与计算机技术—计算机科学与技术]