CRF: A scheduling of multi-granularity locks in object-oriented database systems

This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefly, and presents a MGL model formally. Four locking scheduling 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 the scheduling 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 simulation model, this paper illustrates the comparisons of the performance among these four algorithms. As shown in the experiments, DQS has better performance than SQS, CRFD is better than DQS, CRFS performs better than SQS, and CRFS is the best one of these four scheduling algorithms.