Vesa Karvonen

I also wonder how the results might change with the change shown [here](https://github.com/ocaml-multicore/lockfree/pull/64#issuecomment-1463856886). In my quick tests it gave noticeable improvement and made benchmark results significantly more stable (on Apple...

For benchmarking fun, here is a magically faster variation of the Michael-Scott queue: ```ocaml module Backoff = Kcas.Backoff type 'a node = { next : 'a node; mutable value :...

> Is there anything blocking your implementation from becoming the defacto standard? Well... I don't know. It is perhaps a bit too "magical" for most people's taste. I wanted to...

Here is a version of the optimized Michael-Scott style queue that avoids most uses of `Obj.magic`: ```ocaml module Backoff = Kcas.Backoff (* The [Backoff] from the kcas library does not...

If you ask me, I think it is good to have different implementations. I think that is also part of the idea of this repository. Also, I hope that OCaml...

> Why do you need to pad the root in create? Can it create contention to access the record field head/next if an Atomic is nearby? Yes. If the root...

I totally agree that a scalable lock-free bag would be a useful data structure to have. > Also I would like some advice on how to allot a threadBlock to...

> Should we close this or is it still worth building even with constraints on when it can be used? Let's not be hasty. The issues with Stdlib locks and...

Performance wise it depends. First of all, I think the current implementations of async hopac conversions in Hopac are not optimal. I actually worked on optimizing one of them last...

Hmm... I recall mentioning something like this previously (on Gitter?), but perhaps something like making it so that lifted functions would return a stream if any one of the source...