Transactional boosting: A methodology for highly-concurrent transactional objects

Maurice Herlihy, Eric Koskinen

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

202 Scopus citations

Abstract

We describe a methodology for transforming a large class of highly-concurrent linearizable objects into highly-concurrent transactional objects. As long as the linearizable implementation satisfies certain regularity properties (informally, that every method has an inverse), we define a simple wrapper for the linearizable implementation that guarantees that concurrent transactions without inherent conflicts can synchronize at the same granularity as the original linearizable implementation.

Original languageEnglish
Title of host publicationPPoPP'08 - Proceedings of the 2008 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Pages207-215
Number of pages9
StatePublished - 2008
Event13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP'08 - Salt Lake City, UT, United States
Duration: 20 Feb 200823 Feb 2008

Publication series

NameProceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Conference

Conference13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP'08
Country/TerritoryUnited States
CitySalt Lake City, UT
Period20/02/0823/02/08

Keywords

  • Abstract locks
  • Commutativity
  • Non-blocking algorithms
  • Transactional boosting
  • Transactional memory

Fingerprint

Dive into the research topics of 'Transactional boosting: A methodology for highly-concurrent transactional objects'. Together they form a unique fingerprint.

Cite this