Improving Parallelism in Hardware Transactional Memory
Authors:
Open Access
- 22 March 2018
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 15 (1) , 1-24
Abstract
Today’s hardware transactional memory (HTM) systems rely on existing coherence protocols, which implement a requester-wins strategy. This, in turn, leads to poor performance when transactions frequently conflict, causing them to resort to a non-speculative fallback path. Often, such a path severely limits parallelism. In this article, we propose very simple architectural changes to the existing requester-wins HTM implementations that enhance conflict resolution between hardware transactions and thus improve their parallelism. Our idea is compatible with existing HTM systems, requires no changes to target applications that employ traditional lock synchronization, and is shown to provide robust performance benefits.Keywords
This publication has 33 references indexed in Scilit:
- Quantitative comparison of hardware transactional memory for Blue Gene/Q, zEnterprise EC12, Intel Core, and POWER82015
- Transactional Acceleration of Concurrent Data Structures2015
- Scaling existing lock-based applications with lock elisionCommunications of the ACM, 2014
- Techniques to improve performance in requester-wins hardware transactional memoryACM Transactions on Architecture and Code Optimization, 2013
- Evaluation of Blue Gene/Q hardware support for transactional memories2012
- Performance pathologies in hardware transactional memory2007
- Making the fast case common and the uncommon case simple in unbounded transactional memory2007
- Hybrid transactional memory2006
- Transactional execution: toward reliable, high-performance multithreadingIEEE Micro, 2003
- Language support for lightweight transactions2003