Brief announcement: Concurrent non-commutative boosted transactions

Eric Koskinen, Maurice Herlihy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 noncommuting 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.

Original languageEnglish
Title of host publicationPODC'09 - Proceedings of the 2009 ACM Symposium on Principles of Distributed Computing
Pages272-273
Number of pages2
DOIs
StatePublished - 2009
Event2009 ACM Symposium on Principles of Distributed Computing, PODC'09 - Calgary, AB, Canada
Duration: 10 Aug 200912 Aug 2009

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference2009 ACM Symposium on Principles of Distributed Computing, PODC'09
Country/TerritoryCanada
CityCalgary, AB
Period10/08/0912/08/09

Keywords

  • Commutativity
  • Cyclic dependency
  • Lazy recovery
  • Transactional boosting
  • Transactional memory

Fingerprint

Dive into the research topics of 'Brief announcement: Concurrent non-commutative boosted transactions'. Together they form a unique fingerprint.

Cite this