The semantics of progress in lock-based transactional memory

DOI10.1145/1480881.1480931zbMath1315.68065MaRDI 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

reduction; lower bound; semantics; consensus number; impossibility; lock; transactional memory; try-lock

Mathematics Subject Classification ID

68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)

68Q55: Semantics in the theory of computing

Related Items

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