sleeping_barber

KO | EN

gitlite — search

#javascript #python #hacktoberfest #react #ai #typescript #llm #go #golang #android #machine-learning #rust #deep-learning #linux

sleeping_barber

(★ 17)

The popular sleeping barber problem, implemented with pthreads, semaphores and mutexes in C.

sleeping_barber 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# sleeping_barber
The popular sleeping barber problem, implemented with pthreads, semaphores and mutexes in C.

Input:
<ul>
 <li> number of seats </li>
 <li> total customers </li>
</ul>
 
Output: 
<ul>
 <li> average customers' waiting time in ms </li>
 <li> number of customers that were forced to leave </li>
</ul>
 
Barber: pthread 
Customers: pthreads

"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's chair in a cutting room and a waiting room containing a number of chairs in it. When the barber finishes cutting a customer's hair, he dismisses the customer and goes to the waiting room to see if there are others waiting. If there are, he brings one of them back to the chair and cuts their hair. If there are none, he returns to the chair and sleeps in it.

Each customer, when they arrive, looks to see what the barber is doing. If the barber is sleeping, the customer wakes him up and sits in the cutting room chair. If the barber is cutting hair, the customer stays in the waiting room. If there is a free chair in the waiting room, the customer sits in it and waits their turn. If there is no free chair, the customer leaves.

Based on a naïve analysis, the above decisions 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."

Source: https://en.wikipedia.org/wiki/Sleeping_barber_problem

sleeping_barber

sleeping_barber 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

sleeping_barber

sleeping_barber 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README