Understanding tradeoffs in software transactional memory (2007)
Cached
Download Links
- [www.cs.tau.ac.il]
- [www.cs.tau.ac.il]
- [blogs.sun.com]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROCEEDINGS OF THE INTERNATIONAL SYMPOSIUM ON CODE GENERATION AND OPTIMIZATION |
| Citations: | 19 - 1 self |
BibTeX
@INPROCEEDINGS{Dice07understandingtradeoffs,
author = {Dave Dice and Nir Shavit},
title = {Understanding tradeoffs in software transactional memory},
booktitle = {IN PROCEEDINGS OF THE INTERNATIONAL SYMPOSIUM ON CODE GENERATION AND OPTIMIZATION},
year = {2007},
pages = {21--33},
publisher = {IEEE Computer Society}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
There has been a flurry of recent work on the design of high performance software and hybrid hardware/software transactional memories (STMs and HyTMs). This paper reexamines the design decisions behind several of these stateof-the-art algorithms, adopting some ideas, rejecting others, all in an attempt to make STMs faster. We created the transactional locking (TL) framework of STM algorithms and used it to conduct a range of comparisons of the performance of non-blocking, lock-based, and Hybrid STM algorithms versus fine-grained hand-crafted ones. We were able to make several illuminating observations regarding lock acquisition order, the interaction of STMs with memory management schemes, and the role of overheads and abort rates in STM performance.
