-
Hi dear manuel,
Thanks for this great work. It would be really helpful to include Interval-Based Memory Reclmation(https://www.cs.rochester.edu/u/scott/papers/2018_PPoPP_IBR.pdf) and compare it wit…
-
You might want to take a look at my xenium library: https://github.com/mpoeter/xenium/
It provides a number of concurrent data structures and reclamation schemes (and more is in WIP or on the todo …
-
I’m curious about the details of this benchmark. Instead of running the benchmarks myself, it would be helpful if the benchmark results were published on a page (such as GitHub Pages or the KAIST-CP s…
-
Under [Using Strict Provenance](https://doc.rust-lang.org/std/ptr/index.html#using-strict-provenance), the standard library documents:
> (Yes, if you’ve been using AtomicUsize for pointers in concu…
-
Epoch-based memory reclamation is great, but it is not the right solution for *all* situations that require deferred memory reclamation in concurrent settings. We will probably need to implement hazar…
ghost updated
4 years ago
-
Here is my note on my experiment on mixing epoch-based reclamation (EBR) and pointer-based reclamation (e.g. hazard pointers, HP). My code is here: https://github.com/jeehoonkang/crossbeam/tree/snowf…
-
https://github.com/saligrama/concache
I think that @stjepang might be interested in commenting here. :)
-
-
I was wondering if the API could be generalized to the extend that switching to non-epoch (e.g. [conc](https://github.com/redox-os/tfs/tree/master/conc)) backends would be possible.
For example, th…
ticki updated
7 years ago
-
### Motivation
Once #337 is implemented we have one rwlock per hash table entry.
A hash table entry is a pointer to a list head and the list head then contains pointer to further elements.
Lo…