Two mountain resorts are connected by a road that becomes single lane inside a tunnel that...

Transcribed Image Text:

Two mountain resorts are connected by a road that becomes single lane inside a tunnel that goes through the mountain. One resort is at the left end of the tunnel and the other at the right end of the tunnel. Cars moving from left to right are called "Right-bound" cars and are indicated with odd numbers starting from 1 (1, 3, 5, ...). "Left-bound" cars move from right to left and are indicated with even numbers starting from 0 (0, 2, 4, ..). The tunnel can become deadlocked if a left-bound and a right-bound car enter into the tunnel at the same time. Task: Write a program that synchronizes movement of cars through the tunnel in such a way that prevents the deadlock. You may use any synchronization technique. For example, semaphores would be a good choice. You can assume that there will be steady stream of cars from each side, however, there can be more than one car from one side before we see a car from the opposite side. The tunnel may allow more than one car passing through it, but only in one direction. Cars do not need to have same speed (the time they spend to pass the tunnel). Once a particular car enters and leaves the tunnel, it does not come back again to enter the tunnel. User is not expected to supply any input. The user will simply compile and run your program. A segment from a sample output could be like the following: Right-bound Car I wants to enter the tunnel. Right-bound Car I is in the tunnel. Right-bound Car I is exiting the tunnel. Left-bound Car 4 wants to enter the tunnel. Left-bound Car 4 is in the tunnel. Left-bound Car 4 is exiting the tunnel. Right-bound Car 5 wants to enter the tunnel. Right-bound Car 5 is in the tunnel. Left-bound Car 8 wants to enter the tunnel. // note: Car 8 cannot enter as Car 5 is already in tunnel Right-bound Car 5 is exiting the tunnel. Left-bound Car 8 is in the tunnel. // note: now car 8 can go as car 5 has left the tunnel Right-bound Car 7 wants to enter the tunnel. // note: Car 7 cannot enter as Car 8 is already in tunnel Left-bound Car 10 wants to enter the tunnel. // note: the tunnel may have allowed 10 to enter Left-bound Car 8 is exiting the tunnel. Left-bound Car 10 is in the tunnel. // note: this could have been before the previous statement Left-bound Car 12 wants to enter the tunnel. *** [Hint: you may create two threads for controlling left-bound and right-bound cars. You may also use Thread.sleep() with different sleep times for left-bound and right-bound cars when they enter tunnel. This would allow simulating different time taken to pass the tunnel. You may also use synchronized controller Two mountain resorts are connected by a road that becomes single lane inside a tunnel that goes through the mountain. One resort is at the left end of the tunnel and the other at the right end of the tunnel. Cars moving from left to right are called "Right-bound" cars and are indicated with odd numbers starting from 1 (1, 3, 5, ...). "Left-bound" cars move from right to left and are indicated with even numbers starting from 0 (0, 2, 4, ..). The tunnel can become deadlocked if a left-bound and a right-bound car enter into the tunnel at the same time. Task: Write a program that synchronizes movement of cars through the tunnel in such a way that prevents the deadlock. You may use any synchronization technique. For example, semaphores would be a good choice. You can assume that there will be steady stream of cars from each side, however, there can be more than one car from one side before we see a car from the opposite side. The tunnel may allow more than one car passing through it, but only in one direction. Cars do not need to have same speed (the time they spend to pass the tunnel). Once a particular car enters and leaves the tunnel, it does not come back again to enter the tunnel. User is not expected to supply any input. The user will simply compile and run your program. A segment from a sample output could be like the following: Right-bound Car I wants to enter the tunnel. Right-bound Car I is in the tunnel. Right-bound Car I is exiting the tunnel. Left-bound Car 4 wants to enter the tunnel. Left-bound Car 4 is in the tunnel. Left-bound Car 4 is exiting the tunnel. Right-bound Car 5 wants to enter the tunnel. Right-bound Car 5 is in the tunnel. Left-bound Car 8 wants to enter the tunnel. // note: Car 8 cannot enter as Car 5 is already in tunnel Right-bound Car 5 is exiting the tunnel. Left-bound Car 8 is in the tunnel. // note: now car 8 can go as car 5 has left the tunnel Right-bound Car 7 wants to enter the tunnel. // note: Car 7 cannot enter as Car 8 is already in tunnel Left-bound Car 10 wants to enter the tunnel. // note: the tunnel may have allowed 10 to enter Left-bound Car 8 is exiting the tunnel. Left-bound Car 10 is in the tunnel. // note: this could have been before the previous statement Left-bound Car 12 wants to enter the tunnel. *** [Hint: you may create two threads for controlling left-bound and right-bound cars. You may also use Thread.sleep() with different sleep times for left-bound and right-bound cars when they enter tunnel. This would allow simulating different time taken to pass the tunnel. You may also use synchronized controller

Answer rating: 100% (QA)

To implement a program that synchronizes the movement of cars through the tunnel to prevent deadlock... View the full answer