Software transactional memory for dynamic-sized data structures

By Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer. ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2003

1,096 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Experimental and Cognitive Psychology

View Paper: https://www.semanticscholar.org/paper/15bd6b8fef588739a3ebd7bd62a07e48270422bb

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Experimental and Cognitive Psychology

Citations in the corpus

Language support for lightweight transactions (2003, background): “More recently, Herlihy et al [11] have designed a practical software transactional memory which is obstruction-free and requires only the readily-available compare-and-swap (CAS) instruction.”
Composable memory transactions (2005, background): “Rule (AADMIN) lifts the administrative transitions into the STM world, just as t.”
Transactional memory (2010, methodology): “Dynamic Software Transactional Memory (DSTM) [45] overcame the deﬁciency of previous software transactional memory systems where the transaction size and memory requirements were statically deﬁned in advance.”
Sinfonia: a new paradigm for building scalable distributed systems (2007, background): “Original proposals required hardware changes, but subsequent work [31] showed how to do it in software; more efficient proposals appeared later [16, 15].”
Transactional boosting: a methodology for highly-concurrent transactional objects (2008, methodology): “This approach has been investigated in hardware [14, 21], in software [8, 9, 13, 27], and in schemes that mix hardware and software [6, 25].”
STAMP: Stanford Transactional Applications for Multi-Processing (2008, methodology): “Additional performance can be achieved in the program by using early-release [19], as described in [40].”
LogTM: log-based transactional memory (2006, background): “Finally, many researchers seek all software TM solutions [12, 13, 18, 27].”
Dynamic performance tuning of word-based software transactional memory (2008, methodology): “Therefore, we have also experimented with a sorted linked-list implementation used in various other studies (e.g., [9]).”
Virtualizing transactional memory (2005, positive): “This approach is similar to commit protocols used by software-only transactional memory proposals [9].”
LogTM-SE: Decoupling Hardware Transactional Memory from Caches (2007, background): “While some TM systems operate completely in software (STMs) [12, 14, 27], this paper concentrates on those implemented with hardware support (HTMs).”
Advanced contention management for dynamic software transactional memory (2005, background): “The tradeoff between visible and invisible reads remains application-speci.c: visible reads reduce the overhead for incremental validation when opening new objects, but the requisite bookkeeping exacerbates contention for the memory interconnect.”
Transactional Memory, 2nd edition (2010, methodology): “Herlihy, Luchangco, Moir, and Scherer’s paper [146] was the first published work to describe a dynamic STM (DSTM) system that did not require a programmer to specify, in advance, the locations that a transaction is going to access (unlike Shavit and Touitou’s original STM [285]).”
Concurrent programming without locks (2007, methodology): “…can be classi.ed according to the kind of progress guarantee that they make: Obstruction-freedom is the weakest guarantee: A thread performing an operation is only guaranteed to make progress so long as it does not contend with other threads for access to any location [Herlihy et al. 2003a].”