21 May 2020 by Phillip JohnstonLockless concurrency describes methods for synchronizing concurrent operations without relying on standard OS constructs, such as mutexes, semaphores, and condition variables. The same strategies are also used to implement those OS constructs. Situations requiring lockless concurrency tend to pop up most often in the embedded domain and in OS kernel development. These types of development involve interrupt service routines, real-time processing, and cases where blocking would be disastrous. In other cases, code may need to be synchronized before an OS is fully available, or without an OS at all. Under such conditions, a lock-free programming …
Continue reading “Lockless Concurrency”
To access this content, you must purchase a Membership - check out the different options here. If you're a member, log in.