An effective hybrid transactional memory system with strong isolation guarantees
Authors:
Open Access
- 9 June 2007
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGARCH Computer Architecture News
- Vol. 35 (2) , 69-80
Abstract
We propose signature-accelerated transactional memory (SigTM), ahybrid TM system that reduces the overhead of software transactions. SigTM uses hardware signatures to track the read-set and write-set forpending transactions and perform conflict detection between concurrent threads. All other transactional functionality, including dataversioning, is implemented in software. Unlike previously proposed hybrid TM systems, SigTM requires no modifications to the hardware caches, which reduces hardware cost and simplifies support for nested transactions and multithreaded processor cores. SigTM is also the first hybrid TM system to provide strong isolation guarantees between transactional blocks and non-transactional accesses without additional read and write barriers in non-transactional code. Using a set of parallel programs that make frequent use of coarse-grain transactions, we show that SigTM accelerates software transactions by 30% to 280%. For certain workloads, SigTM can match the performance of a full-featured hardware TM system, while for workloads with large read-sets it can be up to two times slower. Overall, we show that SigTM combines the performance characteristics and strong isolation guarantees of hardware TM implementations with the low cost and flexibility of software TM systems.Keywords
This publication has 23 references indexed in Scilit:
- Enforcing isolation and ordering in STM2007
- Unlocking ConcurrencyQueue, 2006
- Hybrid transactional memory2006
- Compiler and runtime support for efficient software transactional memory2006
- Optimizing memory transactions2006
- Hybrid transactional memory2006
- McRT-STM2006
- Transactional Locking II2006
- Language support for lightweight transactions2003
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970