Queueing Analysis of Global Locking Synchronization Schemes for Multicopy Databases

Locking is a simple scheme to synchronize multiple updates in a multicopy distributed database system. Various schemes were proposed before to maintain the consistency of the distributed database. But these schemes were compared to each other mostly on heuristic base. In this paper, three analytic queueing models for the Network Semaphore scheme, Hopping Permit scheme, and Adaptive Hopping Permit scheme are developed. Incorporating special waiting stages allows the latter two control schemes to he modeled as M/G/1 queueing systems. Shown in this paper are various performance measures of the models, which can provide much insight into these schemes. The validity of these models is verified by the simulation results.

[1]  Irving L. Traiger,et al.  The notions of consistency and predicate locks in a database system , 1976, CACM.

[2]  Neil C. Wilhelm A General Model for the Performance of Disk Systems , 1977, J. ACM.

[3]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[4]  Irving L. Traiger,et al.  A Deadlock-Free Scheme for Resource Locking in a Data-Base Environment , 1974, IFIP Congress.

[5]  Stephen R. Kimbleton,et al.  Computer Communication Networks: Approaches, Objectives, and Performance Considerations , 1975, CSUR.

[6]  Chin-Hwa Lee,et al.  Modeling of two distributed schemes for data synchronization in a computer network , 1978 .

[7]  Christos H. Papadimitriou,et al.  The Concurrency Control Mechanism of SDD-1: A System for Distributed Databases (The Fully Redundant Case) , 1978, IEEE Transactions on Software Engineering.

[8]  Wesley W. Chu,et al.  Optimal File Allocation in a Multiple Computer System , 1969, IEEE Transactions on Computers.

[9]  Mark E. Deppe,et al.  Distributed Data Bases; A Summary of Research , 1976, Comput. Networks.

[10]  W. J. Chandler,et al.  Interference between communicating parallel processes , 1972, CACM.

[11]  Clarence A. Ellis,et al.  A Robust Algorithm for Updating Duplicate Databases , 1977, Berkeley Workshop.

[12]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[13]  J. D. Day,et al.  A principle for resilient sharing of distributed resources , 1976, ICSE '76.

[14]  R. G. Casey,et al.  Allocation of copies of a file in an information network , 1899, AFIPS '72 (Spring).

[15]  Irving L. Traiger,et al.  Views, authorization, and locking in a relational data base system , 1975, AFIPS '75.