Tokentm: Efficient execution of large transactions with hardware transactional memory (2008)
| Venue: | In Proceedings of the 35th Annual International Symposium on Computer Architecture |
| Citations: | 17 - 1 self |
BibTeX
@INPROCEEDINGS{Bobba08tokentm:efficient,
author = {Jayaram Bobba and Neelam Goyal and Mark D. Hill and Michael M. Swift and David A. Wood},
title = {Tokentm: Efficient execution of large transactions with hardware transactional memory},
booktitle = {In Proceedings of the 35th Annual International Symposium on Computer Architecture},
year = {2008}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Current hardware transactional memory systems seek to simplify parallel programming, but assume that large transactions are rare, so it is acceptable to penalize their performance or concurrency. However, future programmers may wish to use large transactions more often in order to integrate with higher-level programming models (e.g., database transactions) or perform selected I/O operations. To prevent the “small transactions are common” assumption from becoming self-fulfilling, this paper contributes TokenTM—an unbounded HTM that uses the abstraction of tokens to precisely track conflicts on an unbounded number of memory blocks. TokenTM implements tokens with new mechanisms, including
