Brief announcement: View transactions: Transactional model with relaxed consistency checks

Yehuda Afek*, Adam Morrison, Moran Tzafrir

*Corresponding author for this work

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

Abstract

We present view transactions, a model for relaxed consistency checks in software transactional memory (STM). View transactions always operate on a consistent snapshot of memory but may commit in a different snapshot. They are therefore simpler to reason about, provide opacity and maintain composability. In addition, view transactions avoid many of the overheads associated with previous approaches for relaxing consistency checks. As a result, view transactions outperform the prior approaches by 1:13× to 2× on various benchmarks.

Original languageEnglish
Title of host publicationPODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing
Pages65-66
Number of pages2
DOIs
StatePublished - 2010
Event29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010 - Zurich, Switzerland
Duration: 25 Jul 201028 Jul 2010

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010
Country/TerritorySwitzerland
CityZurich
Period25/07/1028/07/10

Keywords

  • Algorithms
  • Performance

Fingerprint

Dive into the research topics of 'Brief announcement: View transactions: Transactional model with relaxed consistency checks'. Together they form a unique fingerprint.

Cite this