The semantics of progress in lock-based transactional memory

DOI10.1145/1480881.1480931zbMath1315.68065OpenAlexW2168704934MaRDI QIDQ5261536

Michał Kapałka, Rachid Guerraoui

Publication date: 3 July 2015

Published in: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.5981

zbMATH Keywords

reductionlower boundsemanticsconsensus numberimpossibilitylocktransactional memorytry-lock

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55)

Related Items (12)

Last-use opacity: a strong safety property for transactional memory with prerelease support ⋮ \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores ⋮ Proving opacity of transactional memory with early release ⋮ Weak atomicity for the x86 memory consistency model ⋮ Transactional scheduling for read-dominated workloads ⋮ Universal constructions that ensure disjoint-access parallelism and wait-freedom ⋮ Transactional memory ⋮ Extensible transactional memory testbed ⋮ 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 ⋮ HiperTM: high performance, fault-tolerant transactional memory

This page was built for publication: The semantics of progress in lock-based transactional memory