Case Study: Concurrent Counting - Kernel Recipes 2024

Explore the fundamental challenges of concurrent programming through a case study on efficient and scalable counting in large multicore systems. Delve into the seemingly simple concept of counting to uncover complex issues in concurrency, including design, coding, and validation. Learn how this basic mathematical operation serves as an ideal introduction to concurrent programming, free from the distractions of elaborate data structures or complex synchronization primitives. Join Paul McKenney in this 36-minute conference talk from Kernel Recipes 2024 as he demonstrates how the simplicity of counting allows for a focused examination of the core principles of concurrent systems.