Performance analysis of global concurrency control algorithms and deadlock resolution strategies in multidatabase systems

Even though many global concurrency control (GCC) algorithms have been proposed to ensure global serializability, their performance is not well understood. We address the GCC problem from the performance perspective, and evaluate the performance of several GCC algorithms using a multidatabase simulation model. We also evaluate the performance of alternative deadlock resolution strategies, and analyze its implication with regard to the degree of supporting local autonomy. The simulation results of this study, the first of its kind in the area of multidatabase systems, make it possible to select an appropriate GCC algorithm and a deadlock resolution strategy for a given heterogeneous distributed environment.