Transactional Mutex Locks

DOI10.1007/978-3-642-15291-7_2zbMath1395.68086OpenAlexW1758810311MaRDI QIDQ3162871

Luke Dalessandro, Michael L. Scott, Michael F. Spear, Nir Shavit, Dave Dice

Publication date: 22 October 2010

Published in: Euro-Par 2010 - Parallel Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15291-7_2

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of compilers and interpreters (68N20)

Related Items (6)

Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory ⋮ Verification of Concurrent Programs on Weak Memory Models ⋮ Checking opacity and durable opacity with FDR ⋮ Unnamed Item ⋮ Verifying Opacity of a Transactional Mutex Lock ⋮ SMV: Selective Multi-Versioning STM

Uses Software

• NOrec
• RingSTM

This page was built for publication: Transactional Mutex Locks