SHSachin Handiekarinsachinhandiekar.com00Lock-Free Programming - Java (Part 8)Mar 25 · 6 min read · You've learned how to build lock-free data structures from scratch. Now let's see how the JDK's best engineers applied these same techniques to build the concurrent collections you use every day. ThisJoin discussion
SHSachin Handiekarinsachinhandiekar.com00Lock-Free Programming - Java (Part 7)Mar 25 · 7 min read · You've built a lock-free stack and a lock-free queue. Everything looks correct. CAS verifies the expected value before swapping. What could go wrong? Enter the ABA problem: a subtle bug where CAS succJoin discussion
SHSachin Handiekarinsachinhandiekar.com00Lock-Free Programming - Java (Part 6)Mar 25 · 7 min read · The Treiber Stack was our warm-up. Now for the main event: the Michael-Scott Queue — arguably the most important lock-free data structure ever designed. Published by Mick Michael and Michael Scott in Join discussion
SHSachin Handiekarinsachinhandiekar.com00Lock-Free Programming - Java (Part 5)Mar 25 · 7 min read · The Treiber Stack (published by R. Kent Treiber in 1986) is the simplest lock-free data structure, and it's the perfect starting point for understanding how CAS and AtomicReference come together to buJoin discussion
SHSachin Handiekarinsachinhandiekar.com00Lock-Free Programming - Java (Part 4)Mar 25 · 9 min read · Now that we understand CAS, it's time to meet the Java classes that wrap it in a developer-friendly API. The java.util.concurrent.atomic package is your lock-free toolbox — a collection of thread-safeJoin discussion