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%.
- T. Harris, S. Marlow, S. Peyton-Jones, and M. Herlihy. Composable memory transactions. Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 48--60, 2005. Google Scholar
Digital Library
- M. Herlihy and E. Koskinen. Transactional boosting: a methodology for highly-concurrent transactional objects. Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming, pages 207--216, 2008. Google Scholar
Digital Library
- E. Koskinen and M. Herlihy. Checkpoints and continuations instead of nested transactions. Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, pages 160--168, 2008. Google Scholar
Digital Library
- D. Mitchell and M. Merritt. A distributed algorithm for deadlock detection and resolution. Proceedings of the third annual ACM symposium on Principles of distributed computing, pages 282--284, 1984. Google Scholar
Digital Library
Index Terms
Turbocharging boosted transactions or: how i learnt to stop worrying and love longer transactions
Recommendations
Turbocharging boosted transactions or: how i learnt to stop worrying and love longer transactions
PPoPP '09: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programmingBoosted 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. ...
Unbounded page-based transactional memory
Proceedings of the 2006 ASPLOS ConferenceExploiting thread level parallelism is paramount in the multicore era. Transactions enable programmers to expose such parallelism by greatly simplifying the multi-threaded programming model. Virtualized transactions (unbounded in space and time) are ...
Unbounded page-based transactional memory
Proceedings of the 2006 ASPLOS ConferenceExploiting thread level parallelism is paramount in the multicore era. Transactions enable programmers to expose such parallelism by greatly simplifying the multi-threaded programming model. Virtualized transactions (unbounded in space and time) are ...







Comments