Transactional Lock Elision Meets Combining

DOI10.1145/3087801.3087838MaRDI QIDQ5368968zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

concurrent data structureseliminationflat combininghardware transactional memorylock elision

Mathematics Subject Classification ID

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

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

Cited in

(2)

• Parallel combining: benefits of explicit synchronization
• 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)