Performance Models of Timestamp-Ordering Concurrency Control Algorithms in Distributed Databases
- 1 September 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-36 (9) , 1041-1051
- https://doi.org/10.1109/tc.1987.5009535
Abstract
A distributed database (DDB) consists of copies of data files (usually redundant) geographically distributed and managed on a computer network. One important problem in DDB research is that of concurrency control. This paper develops a performance model of timestamp-ordering concurrency control algorithms in a DDB. The performance model consists of five components: input data collection, transaction processing model, communication subnetwork model, conflict model, and performance measures estimation. In this paper we describe the conflict model in detail. We first determine the probability of transaction restarts, the probability of transaction blocking, and the delay due to blocking for the basic timestamp-ordering algorithm. We then develop conflict models for variations of the basic algorithm. These conflict models are illustrated by numerical examples.Keywords
This publication has 11 references indexed in Scilit:
- An Analysis Of The Effect Of Network Load And Topology On The Performance Of A Concurrency Control Aigorithm In Distributed Database SystemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Multiversion concurrency control—theory and algorithmsACM Transactions on Database Systems, 1983
- Concurrency Control in Distributed Database SystemsACM Computing Surveys, 1981
- Message Delays in Repeated-Service Tandem ConnectionsIEEE Transactions on Communications, 1981
- Distributed database concurrency controls using before-valuesPublished by Association for Computing Machinery (ACM) ,1981
- Concurrency control in a system for distributed databases (SDD-1)ACM Transactions on Database Systems, 1980
- A Majority consensus approach to concurrency control for multiple copy databasesACM Transactions on Database Systems, 1979
- Formal Aspects of Serializability in Database Concurrency ControlIEEE Transactions on Software Engineering, 1979
- System level concurrency control for distributed database systemsACM Transactions on Database Systems, 1978
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976