Step-by-step solution file
Task You should write a single program which simulates the
You should write a single program which simulates the queuing and service of customers under two dierent
queuing strategies and compare the results.
Your program should run two discrete event simulations, one for each strategy. Each simulation should
start at time 0 and run until all customers have been served.
The two queueing strategies are as follows:
1. Use a single queue from which each server will take the next customer as soon as the server becomes
2. Use a queue for each server. Customers will choose the server with the shortest queue on arrival and
will not move from queue to queue.
Your program should be readable and well commented.
Data Structures and Algorithms
Part of the purpose of this subject is to gain an in-depth understanding of data structures and algorithms.
As such, all programming tasks in this subject require you to choose appropriate data structures and
algorithms, and to implement them yourself. You may not take advantage of any built in data structures
more complex than an array or list, but instead should provide your own implementation. If you use any
references other than the lecture notes, ensure you cite them or you may receive 0 for plagiarism. A clear
comment in your code is sufficient.
Write a text le named readme. Include clear instructions on how to compile and run your algorithm.
Ensure that your program compiles and runs correctly on ubuntu, in the lab. If your program does not
compile, it will receive 0 marks. If it doesn't run according to the specication, you will receive very few
marks. You may also include a makele if you wish.
Once your program is complete, you should run it for some sample scanarios and examine the results.
Write a le named analysis.pdf containing a discussion the dierences you observe in statistics between
the two queueing strategies. Which strategy is most ecient?
Both simulations will use identical inputs. Your program should read a le name from standard input,
and run each simulation using the named le as the input le.
The input le has the following format:
The number of servers.
A set of lines each consisting of a customer arrival time followed by the corresponding service time.
Times are in seconds, from the start of the simulation. Although a sample input le has been provided,
your program should still run sucessfully substantially larger inputs.
Output should be to standard output.
For each of the two simulations the output should consist of the following data, clearly labelled:
Number of people served.
Time that the last customer nished being served (total simulation time).
Average service time (note this should depend only on the input le).
Average time a customer spends in queue.
Maximum time a customer spends in queue.
Average length of queue in any given second. For each queue and in total for the multi-queue version
of the simulation.
Maximum Length of queue. For each queue and in total for the multi-queue version of the simulation.
Total idle time for each server.
This question was answered on: Feb 21, 2020
This attachment is locked
We have a ready expert answer for this paper which you can use for in-depth understanding, research editing or paraphrasing. You can buy it or order for a fresh, original and plagiarism-free copy (Deadline assured. Flexible pricing. TurnItIn Report provided)
Need a similar solution fast, written anew from scratch? Place your own custom order
We have top-notch tutors who can help you with your essay at a reasonable cost and then you can simply use that essay as a template to build your own arguments. This we believe is a better way of understanding a problem and makes use of the efficiency of time of the student. New solution orders are original solutions and precise to your writing instruction requirements. Place a New Order using the button below.