Performance analysis of concurrency control in distributed data base systems

Analytic queuing models and queuing network models for different classes of concurrency control algorithms in distributed database systems (DDBSs) are developed. The results of queuing network (QN) analysis are compared with queuing analysis results. Both are verified by simulation results. It is concluded that the results of QN models and models using queuing theory conform with each other for a light workload, but that difference increases as the workload increases. QN analysis conforms more closely with simulation results (considering the approximation made in the case of queuing analysis). Also the QN analysis and models are simpler than queuing analysis and models.<
>