Steal-on-abort: Dynamic Transaction Reordering to Reduce Conflicts in Transactional Memory
نویسندگان
چکیده
ABSTRACT In Transactional Memory (TM) if any two concurrently executing transactions perform conflicting data accesses, one of them is aborted. The transaction to be aborted is usually selected by some form of contention manager. Aborted transactions waste computing resources, and reduce performance. Ideally, concurrent execution of transactions would be ordered to minimize aborts, but such an ordering is often either complex, or unfeasible, to obtain.
منابع مشابه
Steal-on-Abort: Improving Transactional Memory Performance through Dynamic Transaction Reordering
In transactional memory, aborted transactions reduce performance, and waste computing resources. Ideally, concurrent execution of transactions should be optimally ordered to minimise aborts, but such an ordering is often either complex, or unfeasible, to obtain. This paper introduces a new technique called steal-on-abort, which aims to improve transaction ordering at runtime. Suppose transactio...
متن کاملTransaction Reordering to Reduce Aborts in Software Transactional Memory
In transactional memory, conflicts between two concurrently executing transactions reduce performance, reduce scalability, and may lead to aborts, which waste computing resources. Ideally, concurrent execution of transactions would be ordered to minimise conflicts, but such an ordering is often complex, or unfeasible, to obtain. This paper identifies a pattern, called repeat conflicts, that can...
متن کاملToxic Transactions ∗
In Transactional Memory workloads, conflicts among transactions necessitate that some transactions either block, or else abort. The more common approach, aborting, is under-studied. Much effort has explored the use of schedulers and gatekeepers when the global abort rate is high. Handling short spikes in the abort rate, especially due to a single transaction with a high likelihood of conflict, ...
متن کاملContention Management in Dynamic Software Transactional Memory∗
Obstruction-free concurrent algorithms differ from those with stronger nonblocking conditions in that they separate progress from correctness. While it must always maintain data invariants, an obstructionfree algorithm need only guarantee progress in the absence of contention. The programmer can (and indeed must) address progress as an out-of-band, orthogonal concern. In this work we consider t...
متن کاملEnhancing Real-Time Behaviour of Parallel Applications using Intel TSX
With the Transactional Synchronization Extensions (TSX), implemented in the current Intel Haswell processor architecture, hardware transactional memory has now arrived at general-purpose computing. Although TSX simplifies parallel programming and speeds up general-purpose parallel applications, it entails timing difficulties for real-time systems in case of conflicts and transaction aborts. In ...
متن کامل