Transaction reordering to reduce aborts in software transactional memory

Authors:
Mohammad Ansari;Mikel Luján;Christos Kotselidis;Kim Jarvis;Chris Kirkham;Ian Watson
Affiliations:
The University of Manchester, UK;The University of Manchester, UK;The University of Manchester, UK;The University of Manchester, UK;The University of Manchester, UK;The University of Manchester, UK
Venue:
Transactions on High-Performance Embedded Architectures and Compilers IV
Year:
2011

Citing 9
Cited 0

Cilk: an efficient multithreaded runtime system

Journal of Parallel and Distributed Computing - Special issue on multithreading for multiprocessors
Software transactional memory for dynamic-sized data structures

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Advanced contention management for dynamic software transactional memory

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Toward a theory of transactional contention managers

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A flexible framework for implementing software transactional memory

Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
An effective hybrid transactional memory system with strong isolation guarantees

Proceedings of the 34th annual international symposium on Computer architecture
Dynamic performance tuning of word-based software transactional memory

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
CAR-STM: scheduling-based collision avoidance and resolution for software transactional memory

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Transactional locking II

DISC'06 Proceedings of the 20th international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 be a source of conflicts, and presents a novel technique, called steal-on-abort, to reduce the number of conflicts caused by repeat conflicts. Steal-on-abort operates at runtime, and requires no application-specific information or offline pre-processing. Evaluation using a sorted linked list, and STAMP-vacation with different contention managers show steal-on-abort to be highly effective at reducing repeat conflicts, which leads to a range of performance improvements.