Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Sleeping_barber_problem> ?p ?o }
Showing triples 1 to 56 of
56
with 100 triples per page.
- Sleeping_barber_problem abstract "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 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.Each 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ïve 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.The 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.The Sleeping Barber Problem is often attributed to Edsger Dijkstra (1965), one of the pioneers in computer science.Many possible solutions are available. The key element of each is a mutex, which ensures that only one of the participants can change state at once. The barber must acquire this mutual 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, and also when he leaves the shop because no seats were available. This eliminates both of the problems mentioned in the previous section. A number of semaphores is also required to indicate the state of the system. For example, one might store the number of people in the waiting room.A multiple sleeping barbers problem has the additional complexity of coordinating several barbers among the waiting customers.".
- Sleeping_barber_problem wikiPageExternalLink semaphores.
- Sleeping_barber_problem wikiPageExternalLink EWD123.html.
- Sleeping_barber_problem wikiPageID "363196".
- Sleeping_barber_problem wikiPageLength "6255".
- Sleeping_barber_problem wikiPageOutDegree "17".
- Sleeping_barber_problem wikiPageRevisionID "671629004".
- Sleeping_barber_problem wikiPageWikiLink Andrew_S._Tanenbaum.
- Sleeping_barber_problem wikiPageWikiLink Category:Concurrency_(computer_science).
- Sleeping_barber_problem wikiPageWikiLink Cigarette_smokers_problem.
- Sleeping_barber_problem wikiPageWikiLink Computer_science.
- Sleeping_barber_problem wikiPageWikiLink Dining_philosophers_problem.
- Sleeping_barber_problem wikiPageWikiLink Edsger_Dijkstra.
- Sleeping_barber_problem wikiPageWikiLink Edsger_W._Dijkstra.
- Sleeping_barber_problem wikiPageWikiLink Inter-process_communication.
- Sleeping_barber_problem wikiPageWikiLink Mutex.
- Sleeping_barber_problem wikiPageWikiLink Mutual_exclusion.
- Sleeping_barber_problem wikiPageWikiLink Operating_system.
- Sleeping_barber_problem wikiPageWikiLink Process_(computing).
- Sleeping_barber_problem wikiPageWikiLink Producers-consumers_problem.
- Sleeping_barber_problem wikiPageWikiLink Producer–consumer_problem.
- Sleeping_barber_problem wikiPageWikiLink Pseudocode.
- Sleeping_barber_problem wikiPageWikiLink Readers-writers_problem.
- Sleeping_barber_problem wikiPageWikiLink Readers–writers_problem.
- Sleeping_barber_problem wikiPageWikiLink Resource_starvation.
- Sleeping_barber_problem wikiPageWikiLink Semaphore_(programming).
- Sleeping_barber_problem wikiPageWikiLink Starvation_(computer_science).
- Sleeping_barber_problem wikiPageWikiLink Synchronization.
- Sleeping_barber_problem wikiPageWikiLinkText "Sleeping Barber Problem".
- Sleeping_barber_problem wikiPageWikiLinkText "Sleeping barber problem".
- Sleeping_barber_problem wikiPageWikiLinkText "sleeping barber problem".
- Sleeping_barber_problem hasPhotoCollection Sleeping_barber_problem.
- Sleeping_barber_problem wikiPageUsesTemplate Template:No_footnotes.
- Sleeping_barber_problem wikiPageUsesTemplate Template:Use_dmy_dates.
- Sleeping_barber_problem subject Category:Concurrency_(computer_science).
- Sleeping_barber_problem hypernym Communication.
- Sleeping_barber_problem type Agent.
- Sleeping_barber_problem type Area.
- Sleeping_barber_problem type Article.
- Sleeping_barber_problem type Area.
- Sleeping_barber_problem type Article.
- Sleeping_barber_problem comment "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 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.".
- Sleeping_barber_problem label "Sleeping barber problem".
- Sleeping_barber_problem sameAs Problém_spícího_holiče.
- Sleeping_barber_problem sameAs Problema_del_barbero_durmiente.
- Sleeping_barber_problem sameAs مسئله_آرایشگر_خوابیده.
- Sleeping_barber_problem sameAs 居眠り床屋問題.
- Sleeping_barber_problem sameAs Problem_śpiącego_golibrody.
- Sleeping_barber_problem sameAs m.01_n_k.
- Sleeping_barber_problem sameAs Проблема_спящего_парикмахера.
- Sleeping_barber_problem sameAs Problém_spiaceho_holiča.
- Sleeping_barber_problem sameAs Uyuyan_berber_sorunu.
- Sleeping_barber_problem sameAs Q2509067.
- Sleeping_barber_problem sameAs Q2509067.
- Sleeping_barber_problem wasDerivedFrom Sleeping_barber_problem?oldid=671629004.
- Sleeping_barber_problem isPrimaryTopicOf Sleeping_barber_problem.