• Corpus ID: 59681241

Lowering the Overhead of Software Transactional Memory

  title={Lowering the Overhead of Software Transactional Memory},
  author={Virendra J. Marathe and Michael F. Spear and Christopher Heriot and Anurag Acharya and David Eisenstat and William N. Scherer and Michael L. Scott},

Implementation tradeoffs in the design of flexible transactional memory support

A comprehensive strategy for contention management in software transactional memory

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.

Performance Tradeoffs in Software Transactional Memory

Transactional memory (TM), a new programming paradigm, is one of the latest approaches to write programs for next generation multicore and multiprocessor systems. TM is an alternative to lock-based

Semantics, performance and language support for transactional memory

On algorithm design and programming model for multi-threaded computing

Architectural support for high-performing hardware transactional memory systems

This thesis makes several contributions in the design and analysis of low-cost HTM systems that yield good performance for any kind of TM program, including a novel mechanism to elegantly manage speculative versions of transactional data by slightly modifying on-chip memory engine.

Transactional Memory, 2nd edition

This book presents an overview of the state of the art in the design and implementation of transactional memory systems, as of early spring 2010.

Transactional memory

  • Håkan Grahn
  • Computer Science
    J. Parallel Distributed Comput.
  • 2010

Transactifying a Computer Game

This degree project studied the use of STM by taking the large open-source computer game Globulation2 and modifying it from a non-concurrent version to several concurrent versions – a lock-based version and a STM version with finer granularity, as well as an additional STM versions with coarser granularity.

Dividing Transactional Memories by Zero

It is highlighted that providing genuinely unbounded transactions is a hard and complicated task, but full of interesting technical and research problems, and solutions to these problems should be evaluated against large scale benchmarks, like STMBench7.