Description

1            Introduction

• In P1 (Simple Shell Interpreter, SSI), you have built a shell environment to interact with the host operating system.
• Good job! But very soon you find that SSI is missing one of the key features in a real multi-process or multi-thread 9 operating system: scheduling, i.e., all processes or threads created by your SSI are still scheduled by the host operating 10 system, not yours! Interested in building a multi-thread scheduling system for yourself? In this assignment, you will 11 learn how to use the three programming constructs provided by the posix pthread library:
• threads
• mutexes
• condition variables (convars)
• to do so. Your goal is to construct a simulator of an automated control system for the railway track shown in Figure 1 16 (i.e., to emulate the scheduling of multiple threads sharing a common resource in a real operating system).

17 As shown in Figure 1, there are two stations (for high and low priority trains) on each side of the main track. At 18 each station, one or more trains are loaded with commodities. Each train in the simulation commences its loading 19 process at a common start time 0 of the simulation program. Some trains take more time to load, some less. After 20 a train is loaded, it patiently awaits permission to cross the main track, subject to the requirements specified in

21 Section 2.2. Most importantly, only one train can be on the main track at any given time. After a train finishes 22 crossing, it magically disappears. You will use threads to simulate the trains approaching the main track from two 23 different directions, and your program will schedule between them to meet the requirements in Section 2.2. 24 You will use C or C++ and the Linux workstation in ECS242 or ECS348 or the linux.csc.uvic.ca cluster to 25 implement and test your work.

26 2          Trains

• Each train, which will be simulated by a thread, has the following attributes:
• Number: an integer uniquely identifying each train.

Figure 1: The railway system under consideration.

• Direction:
• If the direction of a train is Westbound, it starts from the East station and travels to the West station.
• If the direction of a train is Eastbound, it starts from the West station and travels to the East station.
• Priority: The priority of the station from which it departs.
• Loading Time: The amount of time that it takes to load it (with goods) before it is ready to depart.
• Crossing Time: The amount of time that the train takes to cross the main track.
• Loading time and crossing time are measured in 10ths of a second. These durations will be simulated by having 36 your threads, which represent trains, usleep() for the required amount of time.

37 2.1           Step 1: Reading the input file

• Your program (mts) will accept one parameter on the command line:
• The parameter is the name of the input file containing the definitions of the trains.
• 1.1 Input file format
• The input files have a simple format. Each line contains the information about a single train, such that:
• The first field specifies the direction of the train. It is one of the following four characters:
• e, E, w, or W
• e or E specify a train headed East (East-Bound): e represents an east-bound low-priority train, and E represents
• an east-bound high-priority train;
• w or W specify a train headed West (West-Bound): w presents a west-bound low-priority train, and W represents 47 a west-bound high-priority train.
• Immediately following is an integer that indicates the loading time of the train.
• Immediately following is an integer that indicates the crossing time of the train.
• A newline (\n) ends the line.
• Trains are numbered sequentially from 0 according to their order in the input file. You need to use strtok() to 52 handle the line. More efficiently, you can use fscanf()
• 1.2 An Example
• The following file specifies three trains, two headed East and one headed West.

55                   e 10 6 56                W 6 7 57                    E 3 10

58           It implies the following list of trains:

59

60                         Note: Observe that Train 2 is actually the first to finish the loading process.

61 2.2           Step 2: Simulation Rules

• The rules enforced by the automated control system are:
• Only one train is on the main track at any given time.
• Only loaded trains can cross the main track.
• If there are multiple loaded trains, the one with the high priority crosses.
• If two loaded trains have the same priority, then:
• (a) If they are both traveling in the same direction, the train which finished loading first gets the clearance 68 to cross first. If they finished loading at the same time, the one appeared first in the input file gets the 69 clearance to cross first.
• (b) If they are traveling in opposite directions, pick the train which will travel in the direction opposite of
• which the last train to cross the main track traveled. If no trains have crossed the main track yet, the 72 Eastbound train has the priority.

73 2.3          Step 3: Output

74            For the example, shown in Section 2.1.2, the correct output is:

75                   00:00:00.3 Train 2 is ready to go East 76        00:00:00.3 Train 2 is ON the main track going East 77   00:00:00.6 Train 1 is ready to go West 78   00:00:01.0 Train 0 is ready to go East 79                       00:00:01.3 Train 2 is OFF the main track after going East 80                       00:00:01.3 Train 1 is ON the main track going West

81 00:00:02.0 Train 1 is OFF the main track after going West 82 00:00:02.0 Train 0 is ON the main track going East 83 00:00:02.6 Train 0 is OFF the main track after going East 84 You must:

85                   1. print the arrival of each train at its departure point (after loading) using the format string, prefixed by the 86                       simulation time:

• “Train %2d is ready to go %4s”
• print the crossing of each train using the format string, prefixed by the simulation time:
• “Train %2d is ON the main track going %4s”
• print the arrival of each train (at its destination) using the format string, prefixed by the simulation time:

91                           “Train %2d is OFF the main track after going %4s”

• where:
• there are only two possible values for direction: “East” and “West”
• trains have integer identifying numbers. The ID number of a train is specified implicitly in the input file. The 95 train specified in the first line of the input file has ID number 0.

96                      • trains have loading and crossing times in the range of [1_,99].

97 2.4         Manual Pages

98 Be sure to study the man pages for the various functions to be used in the assignment. For example, the man page 99 for pthread create can be found by typing the command:

• $ man pthread create
• At the end of this assignment you should be familiar with the following functions:
• File access functions:
• (a) atoi
• (b) fopen
• (c) feof
• (d) fgets and strtok and more efficiently you can use fscanf
• (e) fclose
• Thread creation functions:
• (a) pthread create
• (b) pthread exit
• (c) pthread join
• Mutex manipulation functions:
• (a) pthread mutex init
• (b) pthread mutex lock
• (c) pthread mutex unlock
• Condition variable manipulation functions:
• (a) pthread cond init
• (b) pthread cond wait
• (c) pthread cond broadcast
• (d) pthread cond signal
• It is absolutely critical that you read the man pages, and attend the tutorials.
• Your best source of information, as always, is the man 123 For help with the posix interface (in general): 124                 http://www.opengroup.org/onlinepubs/007908799/
• For help with posix threads:
• http://www.opengroup.org/onlinepubs/007908799/xsh/pthread.h.html
• A good overview of pthread can be found at: http://computing.llnl.gov/tutorials/pthreads/

128 3          Tutorial Schedule

129                   In order to help you finish this programming assignment on time successfully, the schedule of this assignment has 130 been synchronized with both the lectures and the tutorials. There are four tutorials arranged during the course of 131      this assignment, including the one on pthread. NOTE: Please do attend the tutorials and follow the tutorial 132    schedule closely.

133 4             Submission: Deliverable 1

134 You will write a design document which answers the following questions. It is recommended that you think through 135 the following questions very carefully before answering them.

136 Unlike P1, no amount of debugging will help after the basic design has been coded. Therefore, it is very important 137 to ensure that the basic design is correct. Answering the following questions haphazardly will basically ensure that 138 Deliverable 2 does not work.

• So think about the following for a few days and then write down the answers.
• How many threads are you going to use? Specify the work that you intend each thread to perform.
• Do the threads work independently? Or, is there an overall “controller” thread?
• How many mutexes are you going to use? Specify the operation that each mutex will guard.
• Will the main thread be idle? If not, what will it be doing?
• How are you going to represent stations (which are collections of loaded trains ready to depart)? That is, what 145 type of data structure will you use?
• How are you going to ensure that data structures in your program will not be modified concurrently?
• How many convars are you going to use? For each convar:
• (a) Describe the condition that the convar will represent.
• (b) Which mutex is associated with the convar? Why?
• (c) What operation should be performed once pthread cond wait() has been unblocked and re-acquired the
• mutex?
• In 15 lines or less, briefly sketch the overall algorithm you will use. You may use sentences such as:
• If train is loaded, get station mutex, put into queue, release station mutex.
• The marker will not read beyond 15 lines.
• Note: Please submit answers to the above on 8.5^′′×11^′′ paper in 10pt font, single spaced with 1” margins left, 156 right, top, and bottom. 2 pages maximum (cover page excluded), on Feb 19 through connex. The design counts for 157 5%.

158 5          Bonus Features

159 Only a simple control system simulator with limited scheduling and synchronization features is required in this assign160 ment. However, students have the option to propose bonus features to include more scheduling and synchronization 161 functions (e.g., to address scheduling fairness issues).

162 If you want to design and implement a bonus feature, you should contact the course instructor for permission 163 before the due date of Deliverable 1, and clearly indicate the feature in the submission of Deliverable 2. The credit 164 for the correctly implemented bonus feature will not exceed 20% of the full marks for this assignment.

165 6              Submission: Deliverable 2

166             The code is submitted through connex. The tutorial instructor will give the detailed instruction in the tutorial.

167 6.1         Submission Requirements

168 Your submission will be marked by an automated script. The script (which is not very smart) makes certain 169 assumptions about how you have packaged your assignment submission. We list these assumptions so that your 170 submission can be marked thus, in a timely, convenient, and hassle-free manner.

• The name of the submission file must be p2.tar.gz
• p2.tar.gz must contain all your files in a directory named p2
• Inside the directory p2, there must be a Makefile. Also there shall be a test input file created by you.
• Invoking make on it must result in an executable named mts being built, without user intervention.
• You may not submit the assignment with a compiled executable and/or object (.o) files; the script will delete 176 them before invoking make.
• Note:
• The script will give a time quota of 1 minute for your program to run on a given input. This time quota is 179 given so that non-terminating programs can be killed.
• Since your program simulates train crossing delays in 10ths of a second, this should not be an issue, at all.
• Follow the output rules specified in the assignment specification, so that the script can tally the output produced 182 by your program against text files containing the correct answer.