DjalimSimaila/Barbershop_problem
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Create README.md

Browse Source
This commit is contained in:
Romain CLEMENT 2023-10-16 10:05:05 +02:00 committed by GitHub
parent f1ca9257a9
commit a4ee19f03c
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 20 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
README.md Normal file
View File

@ -0,0 +1,20 @@
# The Barbershop problem
## Introduction
The original barbershop problem was proposed by Dijkstra. A variation of it
appears in Silberschatz and Galvin’s Operating Systems Concepts.
A barbershop consists of a waiting room with n chairs, and the
barber room containing the barber chair. If there are no customers
to be served, the barber goes to sleep. If a customer enters the
barbershop and all chairs are occupied, then the customer leaves
the shop. If the barber is busy, but chairs are available, then the
customer sits in one of the free chairs. If the barber is asleep, the
customer wakes up the barber. Write a program to coordinate the
barber and the customers.
## Purpose
The purpose of this project is to implement a semaphore from the [little book of semaphores](https://greenteapress.com/semaphores/LittleBookOfSemaphores.pdf) for the school subject R.5.A.10.
## Group
CAPELIER Marla, CECCARELLI Luca, CLEMENT Romain, SIMAILA Djalim