Noun
sleeping barber problem (plural sleeping barber problems)
(computing theory) A problem of interprocess communication and synchronization where one process responds to requests from multiple other threads and sleeps when not doing so. In some cases this may lead to an undesirable state where components are waiting for each other despite being ready.