Share This Author
Software transactional memory for dynamic-sized data structures
A new form of software transactional memory designed to support dynamic-sized data structures, and a novel non-blocking implementation of this STM that uses modular contention managers to ensure progress in practice.
Advanced contention management for dynamic software transactional memory
This work considers both visible and invisible versions of read access, and benchmarks that vary in complexity, level of contention, tendency toward circular dependence, and mix of reads and writes, and identifies a candidate default policy.
Lowering the Overhead of Nonblocking Software Transactional Memory
This work considers the design of low-overhead, obstruction-free software transactional memory for non-garbage-collected languages and eliminates dynamic allocation of transactional metadata and co-locates data that are separate in other systems, thereby reducing the expected number of cache misses on the common-case code path.
A Lazy Concurrent List-Based Set Algorithm
- S. Heller, M. Herlihy, Victor Luchangco, Mark Moir, William N. Scherer, N. Shavit
- Computer ScienceParallel Process. Lett.
- 12 December 2005
We present a novel “lazy” list-based implementation of a concurrent set object. It is based on an optimistic locking scheme for inserts and removes and includes a simple wait-free membership test.…
Lowering the Overhead of Software Transactional Memory
Adaptive Software Transactional Memory
This paper considers four dimensions of the STM design space and presents a new Adaptive STM (ASTM) system that adjusts to the offered workload, allowing it to match the performance of the best known existing system on every tested workload.
Contention Management in Dynamic Software Transactional Memory ∗
This work considers the Java-based obstruction-free Dynamic Software Transaction Memory (DSTM) system of Herlihy et al, introduces several novel policies for contention management, and evaluates their performance on a variety of benchmarks.
Scalable queue-based spin locks with timeout
It is demonstrated that it is possible to obtain both scalability and bounded waiting, using variants of the queue-based locks of Craig, Landin, and Hagersten, and of Mellor-Crummey and Scott.
Phasers: a unified deadlock-free construct for collective and point-to-point synchronization
Performance results obtained from a portable implementation of phasers on three different SMP platforms demonstrate that phasers can deliver superior performance to existing barrier implementations, in addition to the productivity benefits that result from their generality and safety properties.
Conflict Detection and Validation Strategies for Software Transactional Memory
- Michael F. Spear, Virendra J. Marathe, William N. Scherer, M. Scott
- Computer ScienceDISC
- 18 September 2006
The most comprehensive study to date of conflict detection strategies is presented, characterizing the tradeoffs among them and identifying the ones that perform the best for various types of workload and introducing a lightweight heuristic mechanism—the global commit counter— that can greatly reduce the cost of validation and of single-threaded execution.