Linked List with Read-Write Locks for the Entire Linked List

Implementation of a linked list as a Parallel program (based on Pthreads) with read-write locks for the entire linked list

Continue reading “Linked List with Read-Write Locks for the Entire Linked List”

Solution to Senate Bus Problem

This is Java Implementation of the Semaphore based solution for Senate Bus Problem

The Senate Bus Problem (From The Little Book of Semaphores by Allen B. Downey)

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.

Continue reading “Solution to Senate Bus Problem”