Sciweavers

ISCA
2008
IEEE

TokenTM: Efficient Execution of Large Transactions with Hardware Transactional Memory

13 years 4 months ago
TokenTM: Efficient Execution of Large Transactions with Hardware Transactional Memory
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 abstraction of tokens to precisely track conflicts on an unbounded number of memory blocks. TokenTM implements tokens with new mechanisms, including metastate fission/fusion and fast token release. TokenTM executes small transactions fast, executes concurrent large transactions with no penalty to nonconflicting transactions, and gracefully handles paging, context switching, and System-V-style shared memory.
Jayaram Bobba, Neelam Goyal, Mark D. Hill, Michael
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2008
Where ISCA
Authors Jayaram Bobba, Neelam Goyal, Mark D. Hill, Michael M. Swift, David A. Wood
Comments (0)