Limitations of concurrency in transaction processing
ACM Transactions on Database Systems (TODS)
Locking performance in centralized databases
ACM Transactions on Database Systems (TODS)
The performance of multiversion concurrency control algorithms
ACM Transactions on Computer Systems (TOCS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Concurrency control performance modeling: alternatives and implications
ACM Transactions on Database Systems (TODS)
Performance analysis of centralized databases with optimistic concurrency control
Performance Evaluation
The Performance of Alternative Strategies for Dealing with Deadlocks in Database Management Systems
IEEE Transactions on Software Engineering
Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
A Performance Comparison of Multimicro and Mainframe Database Architectures
IEEE Transactions on Software Engineering
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Performance Analysis of Two-Phase Locking
IEEE Transactions on Software Engineering
Concurrency control for high contention environments
ACM Transactions on Database Systems (TODS)
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
Two-phase locking performance and its thrashing behavior
ACM Transactions on Database Systems (TODS)
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
A distributed file service based on optimistic concurrency control
Proceedings of the tenth ACM symposium on Operating systems principles
Database Concurrency Control: Methods, Performance, and Analysis
Database Concurrency Control: Methods, Performance, and Analysis
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Overview of the Jasmin database machine
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Locking Performance in a Shared Nothing Parallel Database Machine
IEEE Transactions on Knowledge and Data Engineering
Determining the Number of Remote Sites Accessed in Distributed Transaction Processing
IEEE Transactions on Parallel and Distributed Systems
Distributed Concurrency Control Based on Limited Wait-Depth
IEEE Transactions on Parallel and Distributed Systems
Performance Comparison of Three Modern DBMS Architectures
IEEE Transactions on Software Engineering
Update Propagation in Distributed Memory Hierarchy
Proceedings of the Sixth International Conference on Data Engineering
Chained Declustering: A New Availability Strategy for Multiprocessor Database Machines
Proceedings of the Sixth International Conference on Data Engineering
Access Invariance and Its Use in High Contention Environments
Proceedings of the Sixth International Conference on Data Engineering
Performance Limits of Two-Phase Locking
Proceedings of the Seventh International Conference on Data Engineering
Wait Depth Limited Concurrency Control
Proceedings of the Seventh International Conference on Data Engineering
Distributed Concurrency Control Performance: A Study of Algorithms, Distribution, and Replication
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
A decomposition solution to the queueing network model of the centralized DBMS with static locking
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
ACM '82 Proceedings of the ACM '82 conference
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
The Performance of an Efficient Distributed Synchronization and Recovery Algorithm
The Journal of Supercomputing
The Database State Machine Approach
Distributed and Parallel Databases
Performance Analysis of Concurrency Control Methods
Performance Evaluation: Origins and Directions
An Efficient Distributed Concurrency Control Algorithm Using Two Phase Priority
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Journal of Computer Science and Technology
A comparative study of some concurrency control algorithms for cluster-based communication networks
Computers and Electrical Engineering
A hybrid concurrency control with deadlock-free approach
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
Transactions for distributed wikis on structured overlays
DSOM'07 Proceedings of the Distributed systems: operations and management 18th IFIP/IEEE international conference on Managing virtualization of networks and services
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
LogBase: a scalable log-structured database system in the cloud
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
There is an ever-increasing demand for more complex transactions and higher throughputs in transaction processing systems leading to higher degrees of transaction concurrency and, hence, higher data contention. The conventional two-phase locking (2PL) Concurrency Control (CC) method may, therefore, restrict system throughput to levels inconsistent with the available processing capacity. This is especially a concern in shared-nothing or data-partitioned systems due to the extra latencies for internode communication and a reliable commit protocol. The optimistic CC (OCC) is a possible solution, but currently proposed methods have the disadvantage of repeated transaction restarts. We present a distributed OCC method followed by locking, such that locking is an integral part of distributed validation and two-phase commit. This method ensures at most one re-execution, if the validation for the optimistic phase fails. Deadlocks, which are possible with 2PL, are prevented by preclaiming locks for the second execution phase. This is done in the same order at all nodes. We outline implementation details and compare the performance of the new OCC method with distributed 2PL through a detailed simulation that incorporates queueing effects at the devices of the computer systems, buffer management, concurrency control, and commit processing. It is shown that for higher data contention levels, the hybrid OCC method allows a much higher maximum transaction throughput than distributed 2PL in systems with high processing capacities. In addition to the comparison of CC methods, the simulation study is used to study the effect of varying the number of computer systems with a fixed total processing capacity and the effect of locality of access in each case. We also describe several interesting variants of the proposed OCC method, including methods for handling access variance, i.e., when rerunning a transaction results in accesses to a different set of objects.