There are times we write code and unintentionally some sort of patterns emerge. Most times, we are not trying to “design a pattern.” We are just trying to make a feature work. And yes, sometimes we do have a clear…
Java provides us with very strong concurrency tools, and they are very convenient to use. In most applications, when we want concurrency, we simply stick to the defaults provided by the JDK and we can run multiple tasks concurrently. Now,…
It’s July 4th, 1997 and NASA’s Mars Pathfinder lander just landed on the red planet (Mars), in a mission described as being flawless. However, in a few days, the spacecraft began experiencing random system resets, causing loss of data and…
We have discussed extensively about false sharing on this blog. In our last post Why Ring Buffers Outperform ArrayBlockingQueue: Understanding the Performance Gap, we did a deep dive into ring buffers and ArrayBlockingQueue, and why ring buffers often outperform ArrayBlockingQueue.…
I am sure if you are reading this blog post, you have come across an ArrayBlockingQueue or some other form of queue. In general, queues serve as a way to pass data or work between threads in concurrent systems. ArrayBlockingQueue…
If you’re reading this blog post, I’m sure you’ve come across the concept of ACID in databases. Database operations happen in transactions, which act as a single unit ensuring that everything succeeds completely or fails entirely with no partial effects.…
We have seen in our previous posts on TAS, TTAS, Ticket, and MCS spinlocks and TAS, TTAS, Ticket, and MCS spinlocks Part 2 various locking mechanisms in java. While those locks are excellent for managing mutual exclusion, they share a…
Maybe it is time you replace your AtomicLong with a LongAdder? Both classes were designed to solve the same critical issue: managing thread-safe 64-bit counters in a concurrent environment. From the official documentation and various public benchmarks, it is clear…
In our previous post, we discussed some advanced spinlock mechanisms in Java. We explored the advantages and drawbacks of popular spinning mechanisms, from the simple Test-And-Set (TAS) and cache-aware Test-Test-And-Set (TTAS), to fairness-oriented Ticket locks, and finally the scalable queue-based…
In any multicore system, threads will compete for shared data. If two threads modify the same memory simultaneously, it leads to data corruption. To resolve these race conditions, we use mutual exclusion (mutex), in which only one thread is allowed…
