Concurrent programming without locks

By Keir Fraser, T. Harris. TOCS, 2007

298 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/6b6e4bc51aa3dccb46f0a4fe3b384774856aab36

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

1. T. Harris
2. J. Larus
3. Ravi Rajwar
4. Nir Shavit
5. D. Dice
6. Ori Shalev
7. Raluca Ada Popa
8. Nickolai Zeldovich

In Hardware and Architecture

1. T. Harris
2. J. Larus
3. Ravi Rajwar
4. Nir Shavit
5. D. Dice
6. Ori Shalev
7. Håkan Grahn
8. Keir Fraser

Citations in the corpus

• Better I/O through byte-addressable, persistent memory (2009, unknown): “actional memory [5].”
• An Ideal-Security Protocol for Order-Preserving Encoding (2013, background): “Our current prototype issues one query at a time, although more fine-grained ordering may be possible, perhaps using fine-grained tree locking [11].”
• Transactional Memory, 2nd edition (2010, methodology): “This kind of interface can be supported both by HTM and STM—concretely, it is broadly similar to the original hardware design of Herlihy and Moss [148], or to the word-based STM of Fraser and Harris [106].”
• Transactional Locking II (2006, methodology): “stm fraser This is the state-of-the-art non-blocking STM of Harris and Fraser [ 6 ].”