https://hackerpaper.kaipfister.de/p/1701.00854/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=35685187urn:hackerpapers:mention:1701.00854:35685187Mon, 24 Apr 2023 08:57:20 GMT<p>To add to this, the superset of these ideas is referred to as &quot;non-blocking&quot;, and lock-freedom is one flavor. There is also obstruction-freedom, starvation-freedom, wait-freedom, etc.. All of which have their own trade-offs and complexities. If you&#x27;re interested in some literature, McKenney&#x27;s book[0] is considered a great practical introduction to these ideas. (also discussed before on HN [1][2]) In applications where you&#x27;re willing to trade throughput for latency (like RTOS schedulers, drivers, audio processing), it can often make sense to go for a wait-free data structure. [0]…</p><p><a href="https://hackerpaper.kaipfister.de/p/1701.00854/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DChttps://news.ycombinator.com/item?id=21961999urn:hackerpapers:submission:1701.00854:21961999Sun, 05 Jan 2020 16:30:55 GMT<p>Is Parallel Programming Hard, and, If So, What Can You Do About It?</p><p></p><p>3 points; 0 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/1701.00854/">Paper and source history</a>. A submission is not an endorsement.</p>cs.DC