期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Scheduling transactions in mobile distributed real-time database systems 被引量:1
1
作者 雷向东 赵跃龙 +1 位作者 陈松乔 袁晓莉 《Journal of Central South University of Technology》 EI 2008年第4期545-551,共7页
A DMVOCC-MVDA (distributed multiversion optimistic concurrency control with multiversion dynamic adjustment) protocol was presented to process mobile distributed real-time transaction in mobile broadcast environment... A DMVOCC-MVDA (distributed multiversion optimistic concurrency control with multiversion dynamic adjustment) protocol was presented to process mobile distributed real-time transaction in mobile broadcast environments. At the mobile hosts, all transactions perform local pre-validation. The local pre-validation process is carried out against the committed transactions at the server in the last broadcast cycle. Transactions that survive in local pre-validation must be submitted to the server for local final validation. The new protocol eliminates conflicts between mobile read-only and mobile update transactions, and resolves data conflicts flexibly by using multiversion dynamic adjustment of serialization order to avoid unnecessary restarts of transactions. Mobile read-only transactions can be committed with no-blocking, and respond time of mobile read-only transactions is greatly shortened. The tolerance of mobile transactions of disconnections from the broadcast channel is increased. In global validation mobile distributed transactions have to do check to ensure distributed serializability in all participants. The simulation results show that the new concurrency control protocol proposed offers better performance than other protocols in terms of miss rate, restart rate, commit rate. Under high work load (think time is ls) the miss rate of DMVOCC-MVDA is only 14.6%, is significantly lower than that of other protocols. The restart rate of DMVOCC-MVDA is only 32.3%, showing that DMVOCC-MVDA can effectively reduce the restart rate of mobile transactions. And the commit rate of DMVOCC-MVDA is up to 61.2%, which is obviously higher than that of other protocols. 展开更多
关键词 mobile distributed real-time database systems muliversion optimistic concurrency control multiversion dynamic adjustment pre-validation multiversion data broadcast
在线阅读 下载PDF
CRF:A Scheduling of Multi-Granularity Locks in Object-Oriented Database Systems
2
作者 Qin Xiao & Pang Liping(Department of Computer Science, Huazhong University of Science and Technology,Wuhan 430074, P. R. China) 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 1998年第4期51-57,共7页
This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are propos... This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are proposed in the paper. The ideas of single queue scheduling(SQS) and dual queue scheduling (DQS) are proposed and the algorithm and the performance evaluation for these two scheduling are presented in some paper. This paper describes a new idea of thescheduling for MGL, compatible requests first (CRF). Combining the new idea with SQS and DQS,we propose two new scheduling algorithms called CRFS and CRFD. After describing the simulationmodel, this paper illustrates the comparisons of the performance among these four algorithms. Asshown in the experiments, DQS has better performance than SQS, CRFD is better than DQS, CRFSperforms better than SQS, and CRFS is the best one of these four scheduling algorithms. 展开更多
关键词 Lock scheduling Multi-granularity lock Concurrency control Compatible requestsfirst Single queue scheduling Dual queue scheduling Object-oriented database system
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部