Turbocharging boosted transactions or: how i learnt to stop worrying and love longer transactions

Authors:
Chinmay Eishan Kulkarni;Osman Unsal;Adrián Cristal;Eduard Ayguadé;Mateo Valero
Affiliations:
BITS Pilani, Pilani, India;Barcelona Supercomputing Center, Barcelona, Spain;Barcelona Supercomputing Center, Barcelona, Spain;Barcelona Supercomputing Center, Barcelona, Spain;Barcelona Supercomputing Center, Barcelona, Spain
Venue:
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Year:
2009

Citing 4
Cited 0

A distributed algorithm for deadlock detection and resolution

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Composable memory transactions

Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming
Transactional boosting: a methodology for highly-concurrent transactional objects

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
Checkpoints and continuations instead of nested transactions

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Boosted transactions offer an attractive method that enables programmers to create larger transactions that scale well and offer deadlock-free guarantees. However, as boosted transactions get larger, they become more susceptible to conflicts and aborts. We describe a linear-time algorithm to detect transactions that cannot make progress, which transactions need to be aborted, and when. The algorithm guarantees zero false positives with minimal aborts. Our proposals, as implemented in DSTM2, increase the transactional throughput of the system, often by more than 30%.