Performance Analysis of Static Locking in Distributed Database Systems

Abstract

Numerous performance models have been proposed for locking algorithms in centralized database systems, but few have been developed for distributed ones. Existing results on distributed locking usually ignore the deadlock problem so as to simplify the analysis. In this paper, a new performance model for static locking in distributed database systems is developed. A queueing model is used to approximate static locking in distributed database systems without deadlocks. Then a random graph model is proposed to find the deadlock probability of each transaction. Finally, the above two models are integrated, so that given the transaction arrival rate, the response time and the effective throughput can be calculated. © 1990 IEEE