Yehuda Afek
Adam Morrison
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.13x to 2x on various benchmarks.
- Philip A. Bernstein and Nathan Goodman. Concurrency Control in distributed database systems. ACM Computing Surveys (CSUR), 13:185--221, June 1981. Google Scholar
Digital Library
- Dave Dice, Ori Shalev, and Nir Shavit. Transactional locking II. In Proceedings of the 20th International Symposium on Distributed Computing (DISC'06), volume 4167 of LNCS, pages 194--208. Springer-Verlag, Oct 2006. Google ScholarDigital Library
- Pascal Felber, Vincent Gramoli, and Rachid Guerraoui. Elastic transactions. In Proceedings of the 23rd International Symposium on Distributed Computing (DISC'09), volume 5805 of LNCS, pages 93--107. Springer-Verlag, Sep 2009. Google ScholarDigital Library
- Rachid Guerraoui and Michal Kapalka. On the correctness of transactional memory. In PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 175--184, New York, NY, USA, 2008. ACM. Google ScholarDigital Library
- Maurice Herlihy, Victor Luchangco, Mark Moir, and William N. Scherer, III. Software transactional memory for dynamic-sized data structures. In PODC '03: Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing, pages 92--101, New York, NY, USA, 2003. ACM. Google ScholarDigital Library
- Maurice Herlihy and J. Eliot B. Moss. Transactional memory: architectural support for lock-free data structures. In Proceedings of the 20th Annual International Symposium on Computer architecture, ISCA '93, pages 289--300, New York, NY, USA, 1993. ACM. Google ScholarDigital Library
- Edward A. Lee. The problem with threads. Computer, 39(5):33--42, 2006. Google ScholarDigital Library
- Christos H. Papadimitriou. The serializability of concurrent database updates. Journal of the ACM, 26(4):631--653, 1979. Google ScholarDigital Library
Index Terms
- Brief announcement: view transactions: transactional model with relaxed consistency checks
Recommendations
Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible
SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architecturesThis brief announcement studies the relation between two STM properties (read invisibility and permissiveness) and two consistency conditions for STM systems, namely, opacity and virtual world consistency. A read operation issued by a transaction is ...
Brief announcement: single-version permissive STM
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computingWe present a single-version STM that satisfies a practical notion of permissiveness: it never aborts read-only transactions, and it only aborts an update transaction due to another conflicting update transaction, thereby avoiding many spurious aborts. ...
Brief announcement: on enhancing concurrency in distributed transactional memory
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computingDistributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violating correctness. To reduce unnecessary aborts and increase concurrency, we ...
Comments