Merge pull request #10 from Globostofo/changeReadme
Adding the car wash problem to the readme
This commit is contained in:
commit
4ae503d4f9
11
README.md
11
README.md
@ -13,6 +13,17 @@ 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.
|
||||
|
||||
## Similar implementation
|
||||
We implemented the following problem, which is similar to the barbershop problem
|
||||
### Car Wash Problem
|
||||
Imagine a car wash service with the following constraints:
|
||||
|
||||
* **One Car Wash Bay**: There's only one car wash bay where cars are washed. If the bay is empty, a car can directly go into the bay for a wash. If the bay is occupied, the car has to wait.
|
||||
|
||||
* **Waiting Area:** There's a waiting area that can accommodate *n* cars. When the bay is occupied, arriving cars will park in the waiting area. If the waiting area is full, the car has to come back later.
|
||||
|
||||
* **Attendant**: An attendant is responsible for signaling cars to move into the bay when it's free. If there are no cars in the waiting area and the bay is free, the attendant can take a break.
|
||||
|
||||
## 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.
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user