检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华中科技大学计算机科学与技术学院,湖北武汉430074
出 处:《小型微型计算机系统》2009年第11期2210-2215,共6页Journal of Chinese Computer Systems
基 金:国家"八六三"高技术研究发展计划项目(2007AA01Z309)资助;国家自然科学基金项目(60873030)资助;国防预研基金项目(9140A04010209JW0504;9140A5040208JW501)资助;湖北省自然科学基金项目资助
摘 要:在无线数据广播环境中,从移动客户机到服务器的上行带宽非常有限,传统的并发控制协议不适合这种不对称通信环境.本文提出一种可变乐观并发控制协议,服务器周期性向移动客户机广播数据对象,同时把一个广播周期分成若干个子周期,在两个连续的子周期间,一个保留空间被预留来存放服务器更新事务在第一个子周期开始后修改的所有数据对象,移动只读事务通过比较服务器更新事务提交的写集合和自己读集合来自主进行一致性验证,如果只读事务不能通过部分验证,它不会被草率地夭折并重新启动,相反,应用一个改进的向前验证策略,帮助移动只读事务争取更多提交机会.最后,本文进行充分的实验对提出的算法性能进行了评价.In a wireless data broadcast environment, there is a limited upstream bandwidth from mobile clients to the fixed database server. Traditional concurrency protocols are unsuitable in such an asymmetric communication environment. In this paper, we introduce a variant of the optimistic concurrency control protocols. The fixed database server broadcasts data objects to mobile clients periodically. The broadcast cycle is divided into multiple sub-cycles. Between two sub-cycles, there is a reserved space to accomodate identities for all the data objects which are updated by transactions in the server after the first sub-cycle begins. A read-only mobile transaction can validate its consistency autonomously by comparing its read-set with the committed write-set of the update transactions. If a read-only transaction cannot pass the partial validation, it is not simply aborted and restarted. Instead, an enhanced forward validation policy is applied, which help read-only transactions have more chances to commit. Extensive experiments are conducted to evaluate the performance of the proposed algorithms.
关 键 词:数据广播 乐观并发控制 移动实时事务执行 混合验证策略
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.142.83.171