(computing theory) The undesirable situation where a large number of processes waiting for an event are awoken whenever the event occurs, and then engage in a conflict over which process handles the event.

(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.

Synonym of starlight problem

Synonym of stable marriage problem

plural of open problem

plural of diamond problem

plural of XY problem

plural of champagne problem

plural of toy problem

plural of Bongard problem