These sorts of problems with shared resources require the use of concurrency control, or non-blocking algorithms.

Until recently, all non-blocking algorithms had to be written "natively" with the underlying primitives to achieve acceptable performance.

Other solutions are Non-blocking algorithms.

Non-blocking algorithms are also safe for use in interrupt handlers: even though the preempted thread cannot be resumed, progress is still possible without it.

In computer science, a non-blocking algorithm ensures that threads competing for a shared resource do not have their execution indefinitely postponed by mutual exclusion.

With few exceptions, non-blocking algorithms use atomic read-modify-write primitives that the hardware must provide, the most notable of which is compare and swap (CAS).