New abstractions for effective performance analysis of STM programs

Authors:
Dhruva R. Chakrabarti
Affiliations:
Hewlett-Packard Labs, Palo Alto, CA, USA
Venue:
Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Year:
2010

Citing 2
Cited 2

Kicking the tires of software transactional memory: why the going gets tough

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Transactional locking II

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

Discovering and understanding performance bottlenecks in transactional applications

Proceedings of the 19th international conference on Parallel architectures and compilation techniques
The runtime abort graph and its application to software transactional memory optimization

CGO '11 Proceedings of the 9th Annual IEEE/ACM International Symposium on Code Generation and Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the design and implementation of a dynamic conflict graph annotated with fine grain transaction characteristics and show that this is important information for effective performance analysis of a software transactional memory (STM) program. We show how to implement the necessary support in a compiler and an STM with minimal perturbation of the original behavior of the application.