CPSC 420 -- Lab Exercise

The purpose of this lab exercise is to get you familiar with the C++ implementation of the single server queuing system handed out in class. You should have your print out of the program with you for reference. The updated .cc and .h files and a Makefile for the program are in the tar file mm1tar.tgz.

Modifying the Program to Find the Maximum in the Queue

Study the program carefully and determine how to modify the code to find the maximum queue length. Implement your changes.

Modifying the Program to Model Two Servers in Series

Modify the program to do problem 1.14 on page 100 of the text. Do the problem incrementally (as follows), first working to get the system logic correct, then worrying about things such as the stopping condition and the performance measures.

When you are ready to implement this, make a new directory for the files (separate from the mm1) AND rename the mm1System class (and file) AND put your name in the documentation!!!!

  1. First determine the state variables you should use and the best way to implement them in the program. After doing that,
  2. We decided in class that there should be three events: an arrival to the system (an arrival at the first server) which is basically the same as the current arrival event, moving from the first to the second server (departing first server, arriving at second), and departing the system (departure from the second server). To add these events, do the following:
  3. Now, we need to fix the statistical counters. Since we already have two queues and queue statistics (area under the Q(t) function) are kept track of by the Queue object, we don't need to worry about that.