A Template for Implementing Fast Lock-free Trees Using HTM
From MaRDI portal
Publication:5368978
DOI10.1145/3087801.3087834zbMath1380.68140arXiv1708.04838OpenAlexW2963930218MaRDI QIDQ5368978
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://arxiv.org/abs/1708.04838
Related Items (4)
On the correctness of a lock-free compression-based elastic mechanism for a hash trie design ⋮ The amortized analysis of a non-blocking chromatic tree ⋮ Unnamed Item ⋮ Unnamed Item
Uses Software
This page was built for publication: A Template for Implementing Fast Lock-free Trees Using HTM
