Performance analysis of an algorithm for concurrency control in replicated database systems

Authors:
Mukesh Swinghal;A. K. Agrawala
Affiliations:
-;-
Venue:
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Year:
1986

Citing 0
Cited 4

Performance models of timestamp-ordering concurrency control algorithms in distributed databases

IEEE Transactions on Computers
Analysis of the Probability of Transaction Abort and Throughput of Two Timestamp Ordering Algorithms for Database Systems

IEEE Transactions on Knowledge and Data Engineering
Improving Performance in Replicated Databases through Relaxed Coherency

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
A performance model of database systems under arbitrary data access distribution

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we analyze the performance of a concurrency control algorithm for replicated database systems. We present a model of a distributed database system which provides a framework to study the performance of different concurrency control algorithms. We discuss performance criteria to evaluate different algorithms. We use the model to analyze the performance of an algorithm for concurrency control in replicated database systems. The technique used in analysis is iterative and approximate. We plot a set of performance measures for several values of the model parameters. The results of analysis are compared against a simulation study.