DjalimSimaila/Barbershop_problem
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
19 Commits 1 Branch 0 Tags 44 KiB
C++ 94.6%
QMake 5.4%
a60331d0be
Go to file
Romain CLEMENT a60331d0be
Merge pull request #9 from Globostofo/patch-semantic 
Added more semantic by using binary semaphores
2023-10-17 20:57:36 +02:00
.gitignore vire les configs de vscode et les .out de git 2023-10-16 10:06:47 +02:00
Barbershop-problem.pro Adding - 2023-10-16 10:34:01 +02:00
main.cpp Added more semantic by using binary semaphores 2023-10-17 20:56:33 +02:00
README.md Create README.md 2023-10-16 10:05:05 +02:00

README.md

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 for the school subject R.5.A.10.

Group

CAPELIER Marla, CECCARELLI Luca, CLEMENT Romain, SIMAILA Djalim