Program which simulates the queuing and service of airline passengers.RAR

Program which simulates the queuing and service of airline passengers

CSCI203 ASSIGNMENT 2 Your task for this assignment is to investigate some of the properties of queues and their management. You should write a program which simulates the queuing and service of airline passengers. Your program should first read in a file name from standard input and then open this file and read data from the named file. The input file will contain the following data:  The number of first/business class servers in the system  The number of tourist class servers in the system  A set of passengers, each consisting of an arrival time, a class and a service time. o Class is an integer where 0 indicates a tourist class passenger and 1 indicates a first/business class passenger.  This set is terminated by a dummy record with arrival time and service times all equal to 0.  Note: the arrival times are sorted in ascending order. The simulation is to be of an airline check in system with two sets of servers, first/business class and tourist class, with a single queue associated with each set. Customers arrive in the system and are served by a server of the appropriate class. If all servers of a particular type are busy, the customer will enter either the first/business or tourist class queue as appropriate. The simulation should be run until the last customer has left the system. The simulation will run twice, in the first run each server will only serve passengers of the appropriate class. In the second run the first/business class servers will be able to serve passengers in the tourist class queue if no first/business class customers are waiting. Output, to standard output will consist of the following data for each run:  Number of people served.  Time last service request is completed.  Average total service time.  Average total time in queue(s). Both overall and separate.  Average length of queue. For each queue and overall.  Maximum Length of queue. For each queue and overall.  Total idle time for each server. Notes: Do not use classes – structs are ok but no function pointers in them. Do not use the STL There will be no more than twenty servers of each type (40 total) Each of the two queues will never have more than 500 people in them The simulation should be continuous, i.e. event driven. There should not be a fixed length ‘tick’. Programs must compile and run under gcc (C programs) or g++ (C++ programs). Programs which do not compile and run will receive no marks. Programs should be appropriately documented with comments. Assignments should be typed into a text file called ass2.c or ass2.cpp and submitted via the submit program. submit -u user -c csci203 -a 2 ass2.c or submit -u user -c csci203 -a 2 ass2.cpp where your unix userid should appear instead of user.
Powered by