Sleeping Barber Problem
Version 1.0.0 · Updated 2026-07-28
CORE DEFINITION
In computer science, the sleeping barber problem is a classic inter-process communication and synchronization problem that illustrates the complexities that arise when there are multiple operating system processes. The problem was originally proposed in 1965 by computer science pioneer Edsger Dijkstra, who used it to make the point that general semaphores are often superfluous.
SCAFFOLDING EFFECT
Reduce cognitive load
In computer science, the sleeping barber problem is a classic inter-process communication and synchronization problem that illustrates the complexities that arise when there are multiple operating system processes.
Anchor fast decisions
A classic concurrency synchronization problem in operating systems: how to coordinate customer arrivals, waiting, and wake-up when the barber is asleep or busy, demonstrating inter-process synchronization, mutual exclusion, and avoidance of deadlock and starvation.
MINIMUM ACTION
In progress 0/3Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Sleeping_barber_problemverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS