Brief announcement: on enhancing concurrency in distributed transactional memory

Distributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violating correctness. To reduce unnecessary aborts and increase concurrency, we propose the distributed dependency-aware (or DDA) model for distributed TM, which manages dependencies between conflicting and uncommitted transactions so that they can commit safely. We present a distributed algorithm to decide whether to abort a transaction based on local precedence graphs that model the established dependency relationships. We analyze the performance of our algorithm and illustrate the inherent tradeoff of the DDA model between communication cost and concurrency.

• Type: Conference
• Year: 2010
• Where: PODC
• Authors: Bo Zhang, Binoy Ravindran
• Keywords: Contention Management Policies, Distributed Algorithm, Distributed And Parallel Computing, PODC 2010, Uncommitted Transactions