Distributed concurrency control performance: A study of algorithms, distribution, and replication
Many concurrency control algorithms have been proposed for use in distributed database systems. Despite the large number of available algorithms, and the fact that distributed database systems are becoming a commercial reality, distributed concurrency control performance tradeoffs are still not well understood. In this paper the authors attempt to shed light on some of the important issues by studying the performance of four representative algorithms - distributed 2PL, wound-wait, basic timestamp ordering, and a distributed optimistic algorithm - using a detailed simulation model of a distributed DBMS. The authors examine the performance of these algorithms for various levels of contention, ''distributedness'' of the workload, and data replication. The results should prove useful to designers of future distributed database systems.
- OSTI ID:
- 6888786
- Country of Publication:
- United States
- Language:
- English
Similar Records
Concurrency-control algorithms and their performance in replicated data-based systems
Performance models of timestamp-ordering concurrency control algorithms in distributed databases