Adaptive locks: combining transactions and locks for efficient concurrency

DOI10.1016/j.jpdc.2010.02.006zbMath1233.68172OpenAlexW2153989357MaRDI QIDQ666229

Reimer Behrends, Takayuki Usui, Yannis Smaragdakis, Jacob Evans

Publication date: 7 March 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.02.006

zbMATH Keywords

transactional memoryadaptive lockshybrid locksnested transactions

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical problems of computer architecture (68M07)

Related Items (1)

Weak atomicity for the x86 memory consistency model

Uses Software

• Erlang
• Eraser
• Atomizer
• SNZI
• Autolocker
• STAMP
• Feather-Trace
• PhTM
• CIL

Cites Work

• Unnamed Item
• Unnamed Item
• Executing Java programs with transactional memory
• Atomizer: A dynamic atomicity checker for multithreaded programs
• Exceptions and side-effects in atomic blocks
• Semantics of transactional memory and automatic mutual exclusion
• Toward a theory of transactional contention managers
• Software transactional memory
• SNZI

This page was built for publication: Adaptive locks: combining transactions and locks for efficient concurrency