Transactional locking II

D Dice, O Shalev, N Shavit - International Symposium on Distributed …, 2006 - Springer
The transactional memory programming paradigm is gaining momentum as the approach of
choice for replacing locks in concurrent programming. This paper introduces the …

A lazy snapshot algorithm with eager validation

T Riegel, P Felber, C Fetzer - … 2006, Stockholm, Sweden, September 18-20 …, 2006 - Springer
Most high-performance software transactional memories (STM) use optimistic invisible
reads. Consequently, a transaction might have an inconsistent view of the objects it …

Time-based software transactional memory

P Felber, C Fetzer, P Marlier… - IEEE Transactions on …, 2010 - ieeexplore.ieee.org
Software transactional memory (STM) is a concurrency control mechanism that is widely
considered to be easier to use by programmers than other mechanisms such as locking. The …

Why STM can be more than a research toy

A Dragojević, P Felber, V Gramoli… - Communications of the …, 2011 - dl.acm.org
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 …

Transactional memory with strong atomicity using off-the-shelf memory protection hardware

M Abadi, T Harris, M Mehrara - Proceedings of the 14th ACM SIGPLAN …, 2009 - dl.acm.org
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 …

Time-based transactional memory with scalable time bases

T Riegel, C Fetzer, P Felber - Proceedings of the nineteenth annual ACM …, 2007 - dl.acm.org
Time-based transactional memories use time to reason about the consistency of data
accessed by transactions and about the order in which transactions commit. They avoid the …

Decoupling contention management from scheduling

FR Johnson, R Stoica, A Ailamaki… - Proceedings of the fifteenth …, 2010 - dl.acm.org
Many parallel applications exhibit unpredictable communication between threads, leading to
contention for shared objects. The choice of contention management strategy impacts …

[PDF][PDF] Anatomy of a scalable software transactional memory

Y Lev, V Luchangco, V Marathe, M Moir… - Proc. 4th ACM …, 2009 - cs.uwaterloo.ca
Existing software transactional memory (STM) implementations often exhibit poor scalability,
usually because of nonscalable mechanisms for read sharing, transactional consistency …

Committing conflicting transactions in an STM

HE Ramadan, I Roy, M Herlihy, E Witchel - Proceedings of the 14th ACM …, 2009 - dl.acm.org
Dependence-aware transactional memory (DATM) is a recently proposed model for
increasing concurrency of memory transactions without complicating their interface. DATM …

Methods and apparatus to implement parallel transactions

D Dice, O Shalev, NN Shavit - US Patent 7,669,015, 2010 - Google Patents
The present disclosure describes a unique way for each of multiple processes to operate in
parallel using (eg, reading, modifying, and writing to) the same shared data without causing …