NBR: Neutralization Based Reclamation

This microbenchmark uses the original setbench of Multicore Lab to test and evaluate reclamation algorithms: NBR+, DEBRA,
QSBR, RCU, IBR, and Hazard Pointer considered in the submitted paper in PPOPP21. The reclamation algorithms are tested on two
prominent concurrent data structures, namely lazylist and DGT- search tree data structure.

Version 3  is the latest. We have enhanced the usability of run scripts so that users can run our software even more quickly and easily. Core Implementations remain the same.

The software would be maintained at gitlab repo: https://gitlab.com/aajayssingh/nbr_setbench