Efficient technique for performance analysis of locking protocols

The validity of many analytic studies of the performance of database systems are often hampered by the many approximations made. This is especially true of the way the block queue delays and deadlocks have been handled. An efficient approach to the derivation of the blocking delays of transactions under the static and dynamic two phase locking protocols is given. The problem of deadlocks which has either been neglected or assumed to be of cycle-length two (involving two transactions only) has also been tackled with some degree of success. The analysis is based on simple combinatorial arguments and probability theory. MVA techniques are then applied to the two models. Several conclusions can be drawn regarding the behaviour of the database systems. The analytic results show remarkable good agreement with simulation results