A couple of posts ago I talked about Hazard Eras, a new lock-free wait-free technique for memory reclamation that can be up to 6x faster than Hazard Pointers, but I didn't provide any code (I've been ultra-busy and forgot about it), so here is the code for our implementation, along with an example deployment on the Maged-Harris lock-free linked list, and a set of benchmarks to compare against Hazard Pointers and the fastest URCU there is (URCU Grace Version):
https://github.com/pramalhe/ConcurrencyFreaks/tree/master/CPP/papers/hazarderas
I've also upload the slides I gave for a talk on memory reclamation a year ago, in case you find it interesting:
https://github.com/pramalhe/ConcurrencyFreaks/blob/master/Presentations/Lock-Free%20and%20Wait-Free%20Memory%20Reclamation.pptx
