面向对象数据库多粒度锁调度算法的研究  

STUDY OF SCHEDULING ALGORITHMS FOR MULTIGRANULARITY LOCK IN OBJECTEDORIENTED DATABASE

作　　者：秦啸[1] 庞丽萍[1] 韩宗芬[1] 李胜利[1] 

机构地区：[1]华中理工大学计算机科学与技术学院

出　　处：《小型微型计算机系统》1999年第7期521-525,共5页Journal of Chinese Computer Systems

摘　　要：本文首先简要介绍面向对象数据库的多粒度锁，然后针对传统的单队列锁调度算法（ＳＱＳ），设计了双队列调度算法（ＤＱＳ）和相容优先调度算法（ＣＲＦ）．在建立了一个模拟模型后，对本文提出的锁调度算法进行性能模拟．模拟实验证明了相容优先调度算法比ＳＱＳ和ＤＱＳ都要优越．模拟实验同时研究了切换周期，锁请求的服务率和延迟等待队列的最大长度对ＤＱＳ算法性能的影响，最后研究了硬件资源个数对ＣＲＦＤ算法的影响．This paper introduces the multigranularity locking model in objectedoriented database, then dual queue scheduling algorithm and compatible requests first(CRF) algorithm are proposed in the paper. After presenting a simulation model, the paper illustrates the results of the simulation experiments. According to the results, the performance of the CRF is better than that of the SQS's and DQS's. This paper discusses how switching period, serving rate and maximum length of DQ affect the performance of the DQS, and how the number of hardware resources affects the performance of CRFD is also explained in this paper.

关 键 词：面向对象 数据库 多粒度锁 调度算法 

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