Many of the challenges in building shared-memory data structures stem from needing to
update several memory locations at once—eg, updating four pointers to insert an item into a …

Transactional memory systems are expected to enable parallel programming at lower
programming complexity, while delivering improved performance over traditional lock-based …

A high-concurrency transactional memory (TM) implementation needs to track concurrent
accesses, buffer speculative updates, and manage conflicts. We present a system, FlexTM …

Why STM can be more than a research toy Page 1 70 CommuniCations oF the aCm | APRIL
2011 | vOL. 54 | nO. 4 contributed articles whILE muLTIcoRE ARchITEcTuRES are increasingly …

This paper introduces a new way to provide strong atomicity in an implementation of
transactional memory. Strong atomicity lets us offer clear semantics to programs, even if they …

The present invention employs three decoupled hardware mechanisms: read and write
signatures, which summarize per-thread access sets; per-thread conflict summary tables …

Transactional Memory (TM) promises to simplify parallel programming by replacing locks
with atomic transactions. Despite much recent progress in TM research, there is very little …

Recent studies of irregular applications such as finite-element mesh generators and data-
clustering codes have shown that these applications have a generalized data parallelism …

Computers with multiple processor cores using shared memory are now ubiquitous. In this
paper, we present several parallel geometric algorithms that specifically target this …

" Is transactional memory useful?" is the question that cannot be answered until we provide
substantial applications that can evaluate its capabilities. While existing TM applications can …