> Make any data structure wait-free as long as it has a copy constructor
I'm going to hazard a guess that in many cases, a simple mutex (or even better, striped mutexes) will perform better.
I'm going to hazard a guess that in many cases, a simple mutex (or even better, striped mutexes) will perform better.
"Several years ago, when Andreia first came up with the idea that we could use a reader-writer lock to achieve wait-freedom, I though that was crazy, but cool. After joining up forces with Pascal and a lot of work, we were able to turn that into a universal construction, CX."
"- wait-freedom can be achieved with locks"
That's wouldn't be the same as a 'simple mutex', would it? Which is absolutely not wait-free (even if I don't understand how the OP is using locks.)
I guess we need to wait for the arxiv to come back and read the paper for the details.