The advent of multicore processors has renewed interest in the idea of incorporating
transactions into the programming model used to write parallel programs. This approach …

Mutual exclusion locks remain the de facto mechanism for concurrency control on shared-
memory data structures. However, their apparent simplicity is deceptive: It is hard to design …

Programmers have traditionally used locks to synchronize concurrent access to shared data.
Lock-based synchronization, however, has well-known pitfalls: using locks for fine-grain …

Atomic blocks allow programmers to delimit sections of code as' atomic', leaving the
language's implementation to enforce atomicity. Existing work has shown how to implement …

Transactional Memory (TM) simplifies parallel programming by allowing for parallel
execution of atomic tasks. Thus far, TM systems have focused on implementing transactional …

Transactional memory (TM) promises to simplify concurrent programming while providing
scalability competitive to fine-grained locking. Language-based constructs allow …

Transactional memory provides a concurrency control mechanism that avoids many of the
pitfalls of lock-based synchronization. Researchers have proposed several different …

Transactional memory provides a new concurrency control mechanism that avoids many of
the pitfalls of lock-based synchronization. High-performance software transactional memory …

Atomos is the first programming language with implicit transactions, strong atomicity, and a
scalable multiprocessor implementation. Atomos is derived from Java, but replaces its …

This paper presents a software transactional memory system that introduces first-class C++
language constructs for transactional programming. We describe new C++ language …