On partial wait-freedom in transactional memory

Petr Kuznetsov, Srivatsan Ravi

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

Abstract

Transactional memory (TM) is a convenient synchronization tool that allows concurrent threads to declare sequences of instructions on shared data as speculative transactions with "all-or-nothing" semantics. It is known that dynamic transactional memory cannot provide wait-free progress ensuring that every transaction commits in a finite number of its own steps. In this paper, we explore the costs of providing wait-freedom to only a subset of transactions. We require that read-only transactions commit in the wait-free manner, while updating transactions are guaranteed to commit only if they run in the absence of concurrency. We show that this kind of partial wait-freedom, combined with attractive requirements like read invisibility or disjoint-access parallelism, incurs considerable complexity costs.

Original languageEnglish
Title of host publicationICDCN 2015 - Proceedings of the 16th International Conference on Distributed Computing and Networking
PublisherAssociation for Computing Machinery
ISBN (Electronic)9781450329286
DOIs
Publication statusPublished - 4 Jan 2015
Event16th International Conference on Distributed Computing and Networking, ICDCN 2015 - Goa, India
Duration: 4 Jan 20157 Jan 2015

Publication series

NameACM International Conference Proceeding Series
Volume04-07-January-2015

Conference

Conference16th International Conference on Distributed Computing and Networking, ICDCN 2015
Country/TerritoryIndia
CityGoa
Period4/01/157/01/15

Keywords

  • D.4.1 [operating systems]: [concurrency, synchronization, multiprocessing]
  • F.1.2 [modes of computation]: [parallelism and concurrency]
  • Theory

Fingerprint

Dive into the research topics of 'On partial wait-freedom in transactional memory'. Together they form a unique fingerprint.

Cite this