Further Reading: Concurrency Primitives

Back to Concurrency Primitives

Books

"The Art of Multiprocessor Programming" by Herlihy & Shavit - Concurrency primitives - Lock-free algorithms

Key Takeaways

  1. Locks: Exclusive access to resources
  2. Semaphores: Counting resources
  3. Channels: Communication between threads
  4. Deadlocks: Prevent with ordering and timeouts