Permissiveness in Transactional Memories

DOI10.1007/978-3-540-87779-0_21zbMath1161.68387OpenAlexW1597783682MaRDI QIDQ3540238

Vasu Singh, Thomas A. Henzinger, Rachid Guerraoui

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/125702/files/main.pdf

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (9)

Perspectives on Transactional Memory ⋮ Correctness of concurrent executions of closed nested transactions in transactional memory systems ⋮ Towards a universal construction for transaction-based multiprocess programs ⋮ On speculative replication of transactional systems ⋮ On avoiding spare aborts in transactional memory ⋮ A single-version STM that is multi-versioned permissive ⋮ Inherent limitations on disjoint-access parallel implementations of transactional memory ⋮ In the Search for Optimal Concurrency ⋮ Non-interference and local correctness in transactional memory

Cites Work

• A Lazy Snapshot Algorithm with Eager Validation
• Completeness and Nondeterminism in Model Checking Transactional Memories
• The serializability of concurrent database updates

This page was built for publication: Permissiveness in Transactional Memories