Distributed Transaction Processing on an Ordering Network

Authors:Srinivasa, Rashmi, Department of Computer ScienceUniversity of Virginia Williams, Craig, Department of Computer ScienceUniversity of Virginia Reynolds, Paul, Department of Computer ScienceUniversity of Virginia

The increasing demand for high throughputs in transaction processing systems leads to high degrees of transaction concurrency and hence high data contention. The conventional dynamic two-phase locking (2PL) concurrency control (CC) technique causes system thrashing at high data contention levels, restricting transaction throughput. Optimistic concurrency control (OCC) is an alternative strategy, but OCC techniques suffer from wasted resources caused by repeated transaction restarts. We propose a new technique, ORDER, that enlists the aid of the interconnection network in a distributed database system in order to coordinate transactions. The network in an ORDER system provides total ordering of messages at a low cost, enabling efficient CC. We compare the performance of dynamic 2PL and ORDER, using both an analytical model and a simulation. Unlike previously-proposed models for 2PL, our analytical model predicts performance accurately even under high data contention. We study the effects of various parameters on performance, and demonstrate that ORDER outperforms dynamic 2PL for a wide range of workloads.

All rights reserved (no additional license for public reuse)
Source Citation:

Srinivasa, Rashmi, Craig Williams, and Paul Reynolds. "Distributed Transaction Processing on an Ordering Network." University of Virginia Dept. of Computer Science Tech Report (2001).

University of Virginia, Department of Computer Science
Published Date: