%0 Journal Article %1 Ruan:2015:TRW %A Ruan, Wenjia %A Liu, Yujie %A Spear, Michael %C New York, NY, USA %D 2015 %I ACM %J ACM Trans. Archit. Code Optim. %K Conflicts Optimization TransactionalMemory %N 4 %P 63:1--63:24 %R 10.1145/2688904 %T Transactional Read-Modify-Write Without Aborts %U http://doi.acm.org/10.1145/2688904 %V 11 %X Language-level transactions are said to provide “atomicity,” implying that the order of operations within a transaction should be invisible to concurrent transactions and thus that independent operations within a transaction should be safe to execute in any order. In this article, we present a mechanism for dynamically reordering memory operations within a transaction so that read-modify-write operations on highly contended locations can be delayed until the very end of the transaction. When integrated with traditional transactional conflict detection mechanisms, our approach reduces aborts on hot memory locations, such as statistics counters, thereby improving throughput and reducing wasted work. We present three algorithms for delaying highly contended read-modify-write operations within transactions, and we evaluate their impact on throughput for eager and lazy transactional systems across multiple workloads. We also discuss complications that arise from the interaction between our mechanism and the need for strong language-level semantics, and we propose algorithmic extensions that prevent errors from occurring when accesses are aggressively reordered in a transactional memory implementation with weak semantics.

@article{Ruan:2015:TRW, abstract = {Language-level transactions are said to provide “atomicity,” implying that the order of operations within a transaction should be invisible to concurrent transactions and thus that independent operations within a transaction should be safe to execute in any order. In this article, we present a mechanism for dynamically reordering memory operations within a transaction so that read-modify-write operations on highly contended locations can be delayed until the very end of the transaction. When integrated with traditional transactional conflict detection mechanisms, our approach reduces aborts on hot memory locations, such as statistics counters, thereby improving throughput and reducing wasted work. We present three algorithms for delaying highly contended read-modify-write operations within transactions, and we evaluate their impact on throughput for eager and lazy transactional systems across multiple workloads. We also discuss complications that arise from the interaction between our mechanism and the need for strong language-level semantics, and we propose algorithmic extensions that prevent errors from occurring when accesses are aggressively reordered in a transactional memory implementation with weak semantics.}, acmid = {2688904}, added-at = {2015-12-01T14:03:28.000+0100}, address = {New York, NY, USA}, articleno = {63}, author = {Ruan, Wenjia and Liu, Yujie and Spear, Michael}, biburl = {https://www.bibsonomy.org/bibtex/22584e452488fad5dfd3a89bd78c6de4f/gron}, description = {Transactional Read-Modify-Write Without Aborts}, doi = {10.1145/2688904}, interhash = {085f528638e9afc03c6a4db59d3ef8f6}, intrahash = {2584e452488fad5dfd3a89bd78c6de4f}, issn = {1544-3566}, issue_date = {January 2015}, journal = {ACM Trans. Archit. Code Optim.}, keywords = {Conflicts Optimization TransactionalMemory}, month = jan, number = 4, numpages = {24}, pages = {63:1--63:24}, publisher = {ACM}, timestamp = {2015-12-01T14:03:28.000+0100}, title = {Transactional Read-Modify-Write Without Aborts}, url = {http://doi.acm.org/10.1145/2688904}, volume = 11, year = 2015 }