Skip to content

This repository contains a Java implementation of the Semaphore Senate Bus Problem, which is a classic synchronization problem often used to demonstrate the use of semaphores for managing concurrent access to shared resources.

Notifications You must be signed in to change notification settings

mdineskumar/semphore-senate-bus-problem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 

Repository files navigation

Semaphore Senate Bus Problem in Java

Overview

This problem was originally based on the Senate bus at Wellesley College. Riders come to a bus stop and wait for a bus. When the bus arrives, all the waiting riders invoke boardBus, but anyone who arrives while the bus is boarding has to wait for the next bus. The capacity of the bus is 50 people; if there are more than 50 people waiting, some will have to wait for the next bus. When all the waiting riders have boarded, the bus can invoke depart. If the bus arrives when there are no riders, it should depart immediately.

About

This repository contains a Java implementation of the Semaphore Senate Bus Problem, which is a classic synchronization problem often used to demonstrate the use of semaphores for managing concurrent access to shared resources.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages