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

Yehuda Afek; Adam Morrison; Moran Tzafrir

doi:10.1145/1835698.1835711

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

Yehuda Afek^*, Adam Morrison, Moran Tzafrir

^*Corresponding author for this work

School of Computer Science

Tel Aviv University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

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 language	English
Title of host publication	PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing
Pages	65-66
Number of pages	2
DOIs	https://doi.org/10.1145/1835698.1835711
State	Published - 2010
Event	29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010 - Zurich, Switzerland Duration: 25 Jul 2010 → 28 Jul 2010

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010
Country/Territory	Switzerland
City	Zurich
Period	25/07/10 → 28/07/10

Keywords

Algorithms
Performance

Access to Document

10.1145/1835698.1835711

Cite this

@inproceedings{48c34b47e6de46078edeb08265967f24,

title = "Brief announcement: View transactions: Transactional model with relaxed consistency checks",

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.",

keywords = "Algorithms, Performance",

author = "Yehuda Afek and Adam Morrison and Moran Tzafrir",

year = "2010",

doi = "10.1145/1835698.1835711",

language = "אנגלית",

isbn = "9781605588889",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

pages = "65--66",

booktitle = "PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing",

note = "29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010 ; Conference date: 25-07-2010 Through 28-07-2010",

}

Afek, Y , Morrison, A & Tzafrir, M 2010, Brief announcement: View transactions: Transactional model with relaxed consistency checks. in PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, pp. 65-66, 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, 25/07/10. https://doi.org/10.1145/1835698.1835711

Brief announcement: View transactions: Transactional model with relaxed consistency checks. / Afek, Yehuda ; Morrison, Adam; Tzafrir, Moran.
PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing. 2010. p. 65-66 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Brief announcement

T2 - 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010

AU - Afek, Yehuda

AU - Morrison, Adam

AU - Tzafrir, Moran

PY - 2010

Y1 - 2010

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

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

KW - Algorithms

KW - Performance

UR - http://www.scopus.com/inward/record.url?scp=77956241674&partnerID=8YFLogxK

U2 - 10.1145/1835698.1835711

DO - 10.1145/1835698.1835711

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:77956241674

SN - 9781605588889

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 65

EP - 66

BT - PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing

Y2 - 25 July 2010 through 28 July 2010

ER -

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

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this