The city of BeeOS has a sightseeing tour which departs from a bus stop, takes a city tour and arrives at the same bus stop. There is only one bus that takes these tours indefinitely. The city visitors wait at the bus stop to board the bus, which can hold maximum N people. Each visitor should queue up at the bus stop and not get on until the bus starts its engine. The bus should wait until N visitors have boarded before departing. The bus can start its tour only when it is full. Once the bus has finished the trip, the visitors should get off after the bus stops its engine. All visitors should leave before the bus starts again. The process codes to be run by the bus and visitors are given below without any synchronization. Note that ‘Visitor’ code will be called by each visitor separately. Bus{ loop{ start_engine(); take_tour(); stop_engine(); } } Visitor{ get_on(); get_off(); } Rewrite the Bus and Visitor codes, with convenient mutex and/or semaphore operations, such that all synchronization conditions above are to be satisfied.
The city of BeeOS has a sightseeing tour which departs from a bus stop, takes a city tour and
arrives at the same bus stop. There is only one bus that takes these tours indefinitely. The city visitors wait at
the bus stop to board the bus, which can hold maximum N people. Each visitor should queue up at the bus stop
and not get on until the bus starts its engine. The bus should wait until N visitors have boarded before
departing. The bus can start its tour only when it is full. Once the bus has finished the trip, the visitors should
get off after the bus stops its engine. All visitors should leave before the bus starts again. The process codes to
be run by the bus and visitors are given below without any synchronization. Note that ‘Visitor’ code will be
called by each visitor separately.
Bus{
loop{
start_engine();
take_tour();
stop_engine();
}
}
Visitor{
get_on();
get_off();
}
Rewrite the Bus and Visitor codes, with convenient mutex and/or semaphore operations, such that all
synchronization conditions above are to be satisfied.
![](/static/compass_v2/shared-icons/check-mark.png)
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Operations Research : Applications and Algorithms](https://www.bartleby.com/isbn_cover_images/9780534380588/9780534380588_smallCoverImage.gif)
![Operations Research : Applications and Algorithms](https://www.bartleby.com/isbn_cover_images/9780534380588/9780534380588_smallCoverImage.gif)