From a4ee19f03ce6022499fd252b87e3a18aa481c96c Mon Sep 17 00:00:00 2001 From: Romain CLEMENT Date: Mon, 16 Oct 2023 10:05:05 +0200 Subject: [PATCH] Create README.md --- README.md | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 README.md diff --git a/README.md b/README.md new file mode 100644 index 0000000..4cfa5f3 --- /dev/null +++ b/README.md @@ -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