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…
I came across the paper “The Silently Shifting Semicolon.” The authors argue that a safe and productive language should make sequential consistency a default guarantee across threads, not only within a single thread. That is, if a program says A;…
