Single-version STMs can be multi-version permissive (Extended Abstract)

Hagit Attiya, Eshcar Hillel

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

Abstract

We present PermiSTM, a single-version STM that satisfies a practical notion of permissiveness, usually associated with keeping many versions: it never aborts read-only transactions, and it aborts other transactions only due to a conflicting transaction (which writes to a common item), thereby avoiding spurious aborts. It avoids unnecessary contention on the memory, being strictly disjoint-access parallel.

Original languageEnglish
Title of host publicationDistributed Computing and Networking - 12th International Conference, ICDCN 2011, Proceedings
Pages83-94
Number of pages12
DOIs
StatePublished - 2011
Event12th International Conference on Distributed Computing and Networking, ICDCN 2011 - Bangalore, India
Duration: 2 Jan 20115 Jan 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6522 LNCS

Conference

Conference12th International Conference on Distributed Computing and Networking, ICDCN 2011
Country/TerritoryIndia
CityBangalore
Period2/01/115/01/11

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Single-version STMs can be multi-version permissive (Extended Abstract)'. Together they form a unique fingerprint.

Cite this