Share This Author
NOrec: streamlining STM by abolishing ownership records
An ownership-record-free software transactional memory (STM) system that combines extremely low overhead with unusually clean semantics is presented, and the experience suggests that NOrec may be an ideal candidate for such a software system.
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.
Hybrid NOrec: a case study in the effectiveness of best effort hardware transactional memory
A family of hybrid TMs built using the recent NOrec STM algorithm is introduced that, unlike existing hybrid approaches, provide both low overhead on hardware transactions and concurrent execution of hardware and software transactions.
RingSTM: scalable transactions with a single atomic instruction
The RingSTM system is the first STM that is inherently livelock-free and privatization-safe while at the same time permitting parallel writeback by concurrent disjoint transactions.
Lowering the Overhead of Software Transactional Memory
Transactional Mutex Locks
- Luke Dalessandro, D. Dice, M. Scott, N. Shavit, Michael F. Spear
- Computer ScienceEuro-Par
- 31 August 2010
Using optimized spinlocks and the TL2 STM algorithm as baselines, TML provides the low latency of locks at low thread levels, and the scalability of STM for read-dominated workloads, suggesting that TML is a good reference implementation to use when evaluating STM algorithms.
Privatization techniques for software transactional memory
- Michael F. Spear, Virendra J. Marathe, Luke Dalessandro, M. Scott
- Computer SciencePODC '07
- 12 August 2007
It is argued that privatization comprises a pair of symmetric subproblems: private operations may fail to see updates made by transactions that have committed but not yet completed; conversely, transactions that are doomed but have not yet aborted may see Updates made by private code, causing them to perform erroneous, externally visible operations.
An integrated hardware-software approach to flexible transactional memory
- Arrvindh Shriraman, Michael F. Spear, H. Hossain, Virendra J. Marathe, S. Dwarkadas, M. Scott
- Computer ScienceISCA '07
- 9 June 2007
This work describes an alert on update mechanism (AOU) that allows a thread to receive fast, asynchronous notification when previously-identified lines are written by other threads, and a programmable data isolation mechanism (PDI) that allowing athread to hide its speculative writes from otherthreads, ignoring conflicts, until software decides to make them visible.
A comprehensive strategy for contention management in software transactional memory
- Michael F. Spear, Luke Dalessandro, Virendra J. Marathe, M. Scott
- Computer SciencePPoPP '09
- 14 February 2009
Experimental evaluation demonstrates that the overhead of the mechanisms is low, particularly when conflicts are rare, and that the strategy as a whole provides good throughput and fairness, including livelock and starvation freedom, even for challenging workloads.
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.