Book
Steal-on-Abort: Improving Transactional Memory Performance through Dynamic Transaction Reordering.
| Title: | Steal-on-Abort: Improving Transactional Memory Performance through Dynamic Transaction Reordering. |
|---|---|
| Authors: | Ansari, Mohammad, Luján, Mikel, Kotselidis, Christos, Jarvis, Kim, Kirkham, Chris, Watson, Ian |
| Source: | High Performance Embedded Architectures & Compilers (9783540929895); 2009, p4-18, 15p |
| Abstract: | 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 transactions A and B conflict, and B is aborted. In general it is difficult to predict this first conflict, but once observed, it is logical not to execute the two transactions concurrently again. In steal-on-abort, the aborted transaction B is stolen by its opponent transaction A, and queued behind A to prevent concurrent execution of A and B. Without steal-on-abort, transaction B would typically have been restarted immediately, and possibly had a repeat conflict with transaction A. Steal-on-abort requires no application-specific information, modification, or offline pre-processing. In this paper, it is evaluated using a sorted linked list, red-black tree, STAMP-vacation, and Lee-TM. The evaluation reveals steal-on-abort is highly effective at eliminating repeat conflicts, which reduces the amount of computing resources wasted, and significantly improves performance. [ABSTRACT FROM AUTHOR] |
| Copyright of High Performance Embedded Architectures & Compilers (9783540929895) is the property of Springer Nature / Books and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| DOI: | 10.1007/978-3-540-92990-1_3 |
| Database: | Complementary Index |
Availability