RCU-HTM: Combining RCU with HTM to Implement Highly Efficient Concurrent Binary Search Trees

Article Details
Title:	RCU-HTM: Combining RCU with HTM to Implement Highly Efficient Concurrent Binary Search Trees
Article URLs:	https://doi.org/10.1109/PACT.2017.17 http://doi.ieeecomputersociety.org/10.1109/PACT.2017.17
Alternative Article URLs:
Authors:	Dimitrios Siakavaras	National Technical University of Athens, School of Electrical and Computer Engineering National Technical University of Athens, Computing Systems Laboratory
	Konstantinos Nikas	National Technical University of Athens, School of Electrical and Computer Engineering National Technical University of Athens, Computing Systems Laboratory
	Georgios I. Goumas	National Technical University of Athens, School of Electrical and Computer Engineering National Technical University of Athens, Computing Systems Laboratory
	Nectarios Koziris	National Technical University of Athens, School of Electrical and Computer Engineering National Technical University of Athens, Computing Systems Laboratory
Sharing:	Research produced artifacts
Verification:	Authors have verified information
Artifact Evaluation Badge:	Artifacts for some papers are reviewed by an artifact evaluation, reproducibility, or similarly named committee. This is one such paper that passed review. awarded
Artifact URLs:	https://github.com/rcu-htm/
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/IEEEpact/SiakavarasNGK17
Author Comments:

IEEE/ACM Intl. Conf. on Parallel Architectures and Compilation Techniques, PACT 2017