Microsoft Word - project1.docx
Page 1
Title: “Project 1: Multi-threaded Programming in Java”
Points: 100
Due Date: Sunday June 6, 2021 by 11:59pm WebCourses time
Objectives: To practice programming an application with multiple threads of execution and
synchronizing their access to necessary shared objects.
Description: In this programming assignment you will simulate the package shipping management
system for an automated package shipping operation similar to the one depicted here:
This example package shipping operation has five routing stations (S0 – S4), each of which has an
input and output conveyor connecting to conveyor lines (C0 – C4) that go elsewhere in the system.
Resources were limited when the system was built so each conveyor going to the rest of the facility
must be shared between two routing stations. Since each routing station simultaneously needs an
input and output connection to function, access to the shared conveyor lines must be strictly regulated.
Flow direction in not important in our simulation.
You have been hired to design a simulator for a new package management system being built with
the same design, but possibly fewe
more stations. You are to implement this simulator in Java and
have each routing station function in its own thread. A routing station moves packages from one of
its connected conveyors to the other. A station’s workload is the number of times that a routing
conveyor 4
conveyor 3
conveyor 2
conveyor 1
conveyor 0
S0
S1
S4
S3 S2
CNT 4714 – Project 1 – Summer 2021
Page 2
station needs to have exclusive access to the input and output conveyors during the simulation. Once
a routing station is granted access to both conveyors it calls its doWork()method during which it
will flow packages down each of its connected conveyors (of course it must verify that it has access
and isn’t in conflict with another routing station). After the packages-in and packages-out methods
are run, the workload of the routing station is reduced by 1 and the routing station will release both
of the conveyors and signal waiting routing stations that the conveyors are available. After executing
a flow and releasing its conveyors, a routing station should sleep for some random period of time. A
outing station’s thread stops running when its workload reaches 0. To prevent deadlock, ensure that
each routing station acquires locks on the conveyors it needs in increasing numerical order.
Restrictions:
1. Your source files should begin with comments containing the following information:
*
Name:
Course: CNT 4714 Summer 2021
Assignment title: Project 1 – Multi-threaded programming in Java
Date: June 6, 2021
Class:
*/
2. Do not use a monitor to control the synchronization in your program (i.e., do not use the Java
synchronize statement).
Input Specification:
Your program must initially read from a text file (config.txt) to gather configuration information
for the simulator. The first line of the text file will be the number of routing stations to use during
the simulation. Afterwards, there will be one line for each station. These lines will hold the amount
of work each station needs to process (i.e, the number of times it needs to move packages down the
conveyor system). Only use integers in your configuration file, decimals will not be needed. You
can assume that the maximum number of stations will be 10.
Output Specification:
Your simulator must output the following text to let the user know what the simulator is doing in each
of these situations:
1. An input conveyor is set:
Routing Station X: Input connection is set to conveyor number Cn.
2. An output conveyor is set:
Routing Station X: Output connection is set to conveyor number Cn.
3. A stations workload is set:
Routing Station X: Workload set. Station X has a total of n package
groups to move.
4. A station is granted access to its input conveyor:
Station X: LOCK ACQUIRED! Now holding lock on input conveyor Cn.
Page 3
5. A station is granted access to its output conveyor:
Station X: LOCK ACQUIRED! Now holding lock on output conveyor Cn.
6. A station releasing access to its input conveyor:
Station X: Unlocks input conveyor Cn.
7. A station releasing access to its output conveyor:
Station X: Unable to lock output conveyor Cm – releasing lock on
input conveyor Cn.
8. A station cannot obtain its second lock (on the output conveyor):
Station X: Unlocks output conveyor Cn
9. A station successfully flows packages on input conveyor:
Station X: . . . Active. . . moving packages into station on input
conveyor Cn.
10. A station successfully flows packages on output conveyor:
Station X: . . .Active. . .moving packages packages out of station
on output conveyor Cn.
11. A station completes a flow:
Station X: Number of packages groups left to move is: n.
12. A station has completed its workload:
* * Station X: Workload successfully completed. * * Station Going
Idle!
Deliverables:
Submit the following items via WebCourses no later than 11:59pm June 6, 2021.
(1) All of your .java files.
(2) A copy of a sample execution of your program, i.e., the output produced by your simulator
(this should just be a text file). In your IDE, redirect console output to a file and include
a copy of the entire output file produced by your program.
Page 4
Additional Information:
Actual simulation run in Eclipse (console output
edirected in this example) with config.txt
containing XXXXXXXXXX, is shown below.
Page 5
Page 6
Page 7
Page 8
First part of the simulation
output as redirected from the
console to an output file and
viewed via Sublime.
Page 9
The example scenario below may help you to understand what is happening with a routing station
and the acquisition of locks and work flow. Illustration is based only on S0 from the original
configuration.
Illustration of the timeline of a station in execution
Time 1: Station 0 needs to move a package group from input conveyor (conveyor 0) to the output
conveyor (conveyor 4). It must acquire the locks on conveyor 0 and conveyor 4, in that order. If
Station 1, cu
ently holds the lock on conveyor 0, then Station 0 is blocked and must wait for conveyor
0 to become available. Note that Station 0 cannot attempt to lock conveyor 4 if it is unable to obtain
the lock on conveyor 0.
Time 2: Station 0 acquires lock on conveyor 0. Attempts to lock conveyor 4. If conveyor 4 is not
available (Station 4 cu
ently owns lock on conveyor 4), then Station 0 must release lock on conveyor
0 and block until both conveyor 0 and conveyor 4 can be obtained.
conveyor 0
S0
conveyor 4
S4
S1
conveyor 4
S0
S1
S4
packages to move
(this shows 1 package
group = 1 workload unit)
conveyor 0 locked by S0
packages to move
(this shows 1 package
group = 1 workload unit)
Page 10
Time 3: Station 0 has acquired locks on conveyor 0 and conveyor 4. Packages now moving.
Time 4: Station 0 has successfully moved 1 workload unit of packages from input side to output
side. Station 0 releases locks on conveyor 0 and conveyor 4. Station 0 goes idle for random period
of time if its workload is not yet 0, otherwise, Station 0 terminates.
S0
S1
conveyor 0 locked by S0 conveyor 4 locked by S0
S4
S0
S1
conveyor 0 conveyor 4
S4
packages to move
(this shows 1 package
group = 1 workload unit)
packages moved