Brief announcement: on enhancing concurrency in distributed transactional memory

Authors:
Bo Zhang;Binoy Ravindran
Affiliations:
Virginia Polytechnic Institute, Blacksburg, VA, USA;Virginia Polytechnic Institute, Blacksburg, VA, USA
Venue:
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
2010

Citing 2
Cited 1

On the correctness of transactional memory

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
On avoiding spare aborts in transactional memory

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures

Enhancing concurrency in distributed transactional memory through commutativity

Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.