j_seigh

10 ms·

31.
by j_seigh 1y ago
A few ways to do wait-free hazard pointers, some portable, semi-portable, or not so much in this an subsequent blog posts. It's pretty high level, I'm assuming one knows how asymetric memory barriers and hazard pointers without t
32.
by j_seigh 1y ago
You used quotes so I can't tell if you think it's a real problem or just a self inflicted one because the warning that finalizers aren't guaranteed to run was ignored. If the finalizer was for an object that is just memory, i
33.
by j_seigh 1y ago
I've done implementations of most of these (qsbr, ebr, atomic reference counting, hazard pointers w/o the store/load memory barrier (you're welcome btw), etc...) and have a pretty good idea of how they work and how to us
34.
by j_seigh 1y ago
Could have been worse https://www.nytimes.com/1994/08/05/nyregion/the-terror-of-th... It was really hot and traffic was backed up and at a standstill, so sitting in a car with windows rolled up for hours
35.
by j_seigh 1y ago
Performance from using atomics in reference counting is going to degrade quite a bit under heavy usage due to cache contention. If you are in that situation, you should be looking at something else like RCU or hazard Pointers.
36.
by j_seigh 1y ago
Esper (used for streaming correlation and pattern matching) has time order windows. Basically within a specified time window size, it will reorder events according to their timestamps if they are not too far out of order. For real time st
37.
by j_seigh 1y ago
AFAIK, the relaxed memory models are mostly from processors using pipelined execution and out of order execution. Cache has little to do with it as most modern processors have transparent cache, meaning you can't tell it there except
38.
by j_seigh 1y ago
I did a lock-free ABA-free bounded queue in c++ kind of an exercise. I work mostly with deferred reclamation schemes (e.g. refcounting, quiescent state based reclamation, and epoch based reclamation). A queue requiring deferred reclamatio