Brief Announcement: View Transactions: Transactional Model with Relaxed Consistency Checks

被引:3
|
作者
Afek, Yehuda [1 ]
Morrison, Adam [1 ]
Tzafrir, Moran [1 ]
机构
[1] Tel Aviv Univ, Sch Comp Sci, Tel Aviv, Israel
关键词
D O I
10.1145/1835698.1835711
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.13x to 2x on various benchmarks.
引用
收藏
页码:65 / 66
页数:2
相关论文
共 50 条
  • [1] Brief Announcement: Quasi-Linearizability: Relaxed Consistency for Improved Concurrency
    Afek, Yehuda
    Korland, Guy
    Yanovsky, Eitan
    [J]. DISTRIBUTED COMPUTING, 2010, 6343 : 127 - 129
  • [2] Brief Announcement: Optimizing Consistency Checking for Memory-Intensive Transactions
    Gottschlich, Justin E.
    Connors, Daniel A.
    [J]. PODC'08: PROCEEDINGS OF THE 27TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2008, : 451 - 451
  • [3] Brief Announcement: Selfishness in Transactional Memory
    Eidenbenz, Raphael
    Wattenhofer, Roger
    [J]. SPAA'09: PROCEEDINGS OF THE TWENTY-FIRST ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2009, : 41 - 42
  • [4] Brief Announcement: Optimizing Persistent Transactions
    Zhou, Tingzhe
    Zardoshti, Pantea
    Spear, Michael F.
    [J]. SPAA'19: PROCEEDINGS OF THE 31ST ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURESS, 2019, 2019, : 169 - 170
  • [5] Brief Announcement: Hardware Transactional Persistent Memory
    Giles, Ellis
    Doshi, Kshitij
    Varman, Peter
    [J]. SPAA'18: PROCEEDINGS OF THE 30TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2018, : 227 - 230
  • [6] Brief Announcement: Transactional Memory and the Birthday Paradox
    Zilles, Craig
    Rajwar, Ravi
    [J]. SPAA'07: PROCEEDINGS OF THE NINETEENTH ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2007, : 303 - +
  • [7] Brief Announcement: Transactional Memory Retry Mechanisms
    Spear, Michael F.
    Sveikauskas, Andrew
    Scott, Michael L.
    [J]. PODC'08: PROCEEDINGS OF THE 27TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2008, : 453 - 453
  • [8] Brief Announcement: On Speculative Replication of Transactional Systems
    Romano, Paolo
    Palmieri, Roberto
    Quaglia, Francesco
    Carvalho, Nuno
    Rodrigues, Luis
    [J]. SPAA '10: PROCEEDINGS OF THE TWENTY-SECOND ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2010, : 69 - 71
  • [9] Brief Announcement: A Practical Transactional Memory Interface
    Timnat, Shahar
    Herlihy, Maurice
    Petrank, Erez
    [J]. DISTRIBUTED COMPUTING (DISC 2014), 2014, 8784 : 542 - 543
  • [10] Brief Announcement: Relaxing Opacity in Pessimistic Transactional Memory
    Siek, Konrad
    Wojciechowski, Pawel T.
    [J]. DISTRIBUTED COMPUTING (DISC 2014), 2014, 8784 : 540 - 541