Concurrency

• Scheduling: Trading Latency for Throughput (and Back Again) · 2025-02-12

  Queue disciplines, work stealing, and CPU affinity: how scheduler choices shape p50/p99, and when to bias for one over the other.

• Lock-Free Data Structures: Concurrency Without the Wait · 2024-07-18

  Explore how lock-free algorithms achieve thread-safe data access without traditional locks. Learn the theory behind compare-and-swap, the ABA problem, memory ordering, and practical implementations that power high-performance systems.

• Concurrency Primitives and Synchronization: From Spinlocks to Lock-Free Data Structures · 2024-03-15

  A comprehensive exploration of concurrent programming fundamentals, covering mutexes, spinlocks, semaphores, condition variables, memory ordering, and lock-free programming techniques that enable safe parallel execution.

• Garbage Collection Algorithms: From Mark-and-Sweep to ZGC · 2022-11-22

  A comprehensive exploration of garbage collection algorithms, from classic mark-and-sweep to modern concurrent collectors like G1, Shenandoah, and ZGC. Learn how automatic memory management works and the trade-offs that shape collector design.

• Process Scheduling and Context Switching: How Operating Systems Share the CPU · 2022-05-18

  A deep dive into how operating systems decide which process runs next and how they switch between processes. Understand scheduling algorithms, context switches, and the trade-offs that shape system responsiveness.

• Modern Operating Systems (4th ed.)
• Operating System Concepts (9th ed.)