42 ms·
From 12M ops/s to 305 M ops/s on a lock-free ring buffer. In this post, I walk you step by step through implementing a single-producer single-consumer queue fr
by dalvrosa 7mo ago
From 12M ops/s to 305 M ops/s on a lock-free ring buffer.
In this post, I walk you step by step through implementing a single-producer single-consumer queue from scratch.
This pattern is widely used to share data between threads in the lowest-latency environments.
- loeg 7mo agoYour blog footer mentions that code samples are GPL unless otherwise noted. You don't seem to note otherwise in the article, so -- do you consider these snippets GPL licensed?
- dalvrosa 7mo agoActually I'm not sure. GPL was for source code of the website itself I guess the code samples inside post are under https://david.alvarezrosa.com/LICENSE https://david.alvarezrosa.com/LICENSE But feel free to ping me if you need different license, quite open about it
- random3 7mo agoRing buffers never get old. Here’s a useful mention of some of the most extensive technical work by LMAX team over 15 years ago https://martinfowler.com/articles/lmax.html https://martinfowler.com/articles/lmax.html