Transactional Lock Elision Meets Combining

DOI10.1145/3087801.3087838zbMATH Open1380.68152OpenAlexW2737024159MaRDI QIDQ5368968FDOQ5368968

Authors: Alex Kogan, Yossi Lev 

Publication date: 11 October 2017

Published in: Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3087801.3087838

Recommendations

• Transactional mutex locks
• Adaptive locks: combining transactions and locks for efficient concurrency
• Commutativity-based locking for nested transactions
• Locking based on a pairwise decomposition of the transaction system
• Hybrid atomicity for nested transactions
• The semantics of progress in lock-based transactional memory

zbMATH Keywords

eliminationconcurrent data structureshardware transactional memoryflat combininglock elision

Mathematics Subject Classification ID

Data structures (68P05) Distributed systems (68M14)

Cited In (1)

• A template for implementing fast lock-free trees using HTM

This page was built for publication: Transactional Lock Elision Meets Combining

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368968)