{"id":183,"date":"2013-04-17T12:15:15","date_gmt":"2013-04-17T04:15:15","guid":{"rendered":"http:\/\/blog.dayandcarrot.net\/?p=183"},"modified":"2013-04-17T12:15:15","modified_gmt":"2013-04-17T04:15:15","slug":"sleeping-barber-problem","status":"publish","type":"post","link":"https:\/\/dayandcarrot.space\/?p=183","title":{"rendered":"Sleeping barber problem \uff08\u7761\u89c9\u7684\u7406\u53d1\u5e08\u95ee\u9898\uff09"},"content":{"rendered":"

\u4eca\u5929\u505a\u64cd\u4f5c\u7cfb\u7edf\u4f5c\u4e1a\u78b0\u5230\u7684\u95ee\u9898\uff0c\u4e00\u65f6\u60f3\u4e0d\u51fa\u600e\u4e48\u505a\uff0c\u540e\u6765Google\u4e86\u4e00\u4e0b\u53d1\u73b0\u662f\u4e2a\u7ecf\u5178\u95ee\u9898\u3002
\n=========================================================================
\n\u4ee5\u4e0b\u82f1\u6587\u5185\u5bb9\u8f6c\u8f7d\u81ea\uff1ahttp:\/\/www.answers.com\/topic\/sleeping-barber-problem<\/a>
\n\u672c\u4eba\u7684\u7406\u89e3\u7ee7\u7eed\u5f80\u4e0b\u770b\u3002
\nIn\u00a0computer science<\/a>, the\u00a0sleeping barber problem<\/b>\u00a0is a classic\u00a0inter-process communication<\/a>\u00a0and\u00a0synchronization<\/a>\u00a0problem between multiple\u00a0operating system<\/a>\u00a0processes<\/a>. 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.
\nThe analogy is based upon a hypothetical barber shop with one barber. The barber has one barber chair and a waiting room with a number of chairs in it. When the barber finishes cutting a customer’s hair, he dismisses the customer and then goes to the waiting room to see if there are other customers waiting. If there are, he brings one of them back to the chair and cuts his hair. If there are no other customers waiting, he returns to his chair and sleeps in it.
\nEach customer, when he arrives, looks to see what the barber is doing. If the barber is sleeping, then the customer wakes him up and sits in the chair. If the barber is cutting hair, then the customer goes to the waiting room. If there is a free chair in the waiting room, the customer sits in it and waits his turn. If there is no free chair, then the customer leaves. Based on a na\u00efve analysis, the above description should ensure that the shop functions correctly, with the barber cutting the hair of anyone who arrives until there are no more customers, and then sleeping until the next customer arrives. In practice, there are a number of problems that can occur that are illustrative of general scheduling problems.
\nThe problems are all related to the fact that the actions by both the barber and the customer (checking the waiting room, entering the shop, taking a waiting room chair, etc.) all take an unknown amount of time. For example, a customer may arrive and observe that the barber is cutting hair, so he goes to the waiting room. While he is on his way, the barber finishes the haircut he is doing and goes to check the waiting room. Since there is no one there (the customer not having arrived yet), he goes back to his chair and sleeps. The barber is now waiting for a customer and the customer is waiting for the barber. In another example, two customers may arrive at the same time when there happens to be a single seat in the waiting room. They observe that the barber is cutting hair, go to the waiting room, and both attempt to occupy the single chair.
\nThe Sleeping Barber Problem is often attributed to\u00a0Edsger Dijkstra<\/a>\u00a0(1965), one of the pioneers in computer science.
\nMany possible solutions are available. The key element of each is a\u00a0mutex<\/span><\/a>, which ensures that only one of the participants can change state at once.<\/strong><\/span> The barber must acquire this mutex exclusion before checking for customers and release it when he begins either to sleep or cut hair. A customer must acquire it before entering the shop and release it once he is sitting in either a waiting room chair or the barber chair. This eliminates both of the problems mentioned in the previous section. A number of\u00a0semaphores<\/a>\u00a0are also required to indicate the state of the system. For example, one might store the number of people in the waiting room.
\nA\u00a0multiple sleeping barbers problem<\/i>\u00a0has the additional complexity of coordinating several barbers among the waiting customers.<\/p>\n

Implementation<\/h2>\n