Brief announcement: concurrent non-commutative boosted transactions

Authors:
Eric Koskinen;Maurice Herlihy
Affiliations:
University of Cambridge, Cambridge, United Kingdom;Brown University, Providence, RI, USA
Venue:
Proceedings of the 28th ACM symposium on Principles of distributed computing
Year:
2009

Citing 5
Cited 0

ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging

ACM Transactions on Database Systems (TODS)
Semantics-based concurrency control: beyond commutativity

ACM Transactions on Database Systems (TODS)
Transactional boosting: a methodology for highly-concurrent transactional objects

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
Dreadlocks: efficient deadlock detection

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Committing conflicting transactions in an STM

Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Transactional boosting is a methodology which improves transaction performance by using data-structure commutativity and abstract locks for synchronization. We announce a method for concurrent execution of non-commuting operations from distinct boosted transactions. Abstract locks are passed from one transaction to the next, and dependencies are created, enforcing certain commit orders. We summarize the approach and describe novel techniques for (i) performing recovery lazily and (ii) detecting cyclic dependencies.