Assignment 4

Synchronization II(Shared memory and Semaphores)

Note: The assignment is to be implemented on a client LINUX machine. Cleanup semaphores/shared memories immediately after use.

Problems (As explained in detail in class):

1) Sequencing of Mumbai Local Trains. No. of intermediate signals=3; use processes for representing local trains. Current status of a train in shared memory 2) Flight Scheduling. No. of runways=3; p-threads represent flights. Current status of a flight in shared memory

Submission deadline: report and programs: extended to Monday Aug 31, 1999, 5:40 pm, no late submission for this assignment