Enforcing isolation and ordering in STM
Authors:
Open Access
- 10 June 2007
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 42 (6) , 78-88
Abstract
Transactional memory provides a new concurrency control mechanism that avoids many of the pitfalls of lock-based synchronization. High-performance software transactional memory (STM) implementations thus far provide weak atomicity : Accessing shared data both inside and outside a transaction can result in unexpected, implementation-dependent behavior. To guarantee isolation and consistent ordering in such a system, programmers are expected to enclose all shared-memory accesses inside transactions. A system that provides strong atomicity guarantees isolation even in the presence of threads that access shared data outside transactions. A strongly-atomic system also orders transactions with conflicting non-transactional memory operations in a consistent manner. In this paper, we discuss some surprising pitfalls of weak atomicity, and we present an STM system that avoids these problems via strong atomicity. We demonstrate how to implement non-transactional data accesses via efficient read and write barriers, and we present compiler optimizations that further reduce the overheads of these barriers. We introduce a dynamic escape analysis that differentiates private and public data at runtime to make barriers cheaper and a static not-accessed-in-transaction analysis that removes many barriers completely. Our results on a set of Java programs show that strong atomicity can be implemented efficiently in a high-performance STM system.Keywords
This publication has 48 references indexed in Scilit:
- Type inference against racesScience of Computer Programming, 2007
- Hybrid transactional memory2006
- McRT-STM2006
- Transactional Locking II2006
- Conflict Detection and Validation Strategies for Software Transactional Memory2006
- Transactional MemorySynthesis Lectures on Computer Architecture, 2006
- AtomCaml2005
- Adaptive Software Transactional Memory2005
- Shared memory consistency models: a tutorialComputer, 1996
- On optimistic methods for concurrency controlACM Transactions on Database Systems, 1981