Sleeping Barber Problem

High Quality Content by WIKIPEDIA articles! In computer science, the sleeping barber problem is a classic inter-process communication and synchronization problem between multiple operating system processes. The problem is analogous to that of keeping a barber working when there are customers, resting when there are none and doing so in an orderly manner. The barber and his customers represent aforementioned processes.The analogy is based upon a hypothetical barber shop with one barber, one barber chair, and a number of chairs for waiting customers. When there are no customers, the barber sits in his chair and sleeps. As soon as a customer arrives, he either awakens the barber or leaves. If the barber is awake and cutting someone else's hair, the customer sits down in one of the vacant chairs. If all of the chairs are occupied, the newly arrived customer leaves.

Klappentext

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, the sleeping barber problem is a classic inter-process communication and synchronization problem between multiple operating system processes. The problem is analogous to that of keeping a barber working when there are customers, resting when there are none and doing so in an orderly manner. The barber and his customers represent aforementioned processes.The analogy is based upon a hypothetical barber shop with one barber, one barber chair, and a number of chairs for waiting customers. When there are no customers, the barber sits in his chair and sleeps. As soon as a customer arrives, he either awakens the barber or leaves. If the barber is awake and cutting someone else's hair, the customer sits down in one of the vacant chairs. If all of the chairs are occupied, the newly arrived customer leaves.