You should write a Java, program which simulates the queuing and service of a set of...

 

Transcribed Image Text:

You should write a Java, program which simulates the queuing and service of a set of requests at a fast-food restaurant. Input consists of the following data: The number of primary servers in the system. The number of secondary servers in the system. • A set of service requests each consisting of an arrival time and two service times. 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). For example, the data file: 32 123 335 322 432 524 000 indicates there are 3 primary servers and 2 secondary servers. The first service (customer) arrives in minute 1 (first minute of simulation), and the service requires 2 minutes of primary server's time and 3 minutes of secondary server's time. The second service (customer) arrives in minute 3, and it requires 3 minutes of primary server's time and 5 minutes of secondary server's time, etc. The last entry of the data file 0 0 0 indicate the end of simulation. (Note that it is possible to have two customers arrive in the same time as shown in the above sample data (second and third customers).) Your program should read the name of the data file from standard input and then read the data in the named file into the simulation. For example, the following command will trigger the execution of your program by reading the data file provided: ./QueueSim datafile.dat or java QueueSim datafile.dat The simulation is to be of a system with two sets of servers, primary and secondary, with a single queue associated with each set. Customers arrive in the system and are served first by a primary server and, on completion of this service, by a secondary server. If all servers of a particular type are busy, the customer will enter either the primary or secondary queue as appropriate. The simulation should be run until the last customer has left the system. Output, to standard output, for each version of the queuing process will consist of the following data: • Number of customers 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. NOTE: Since the question is to assess your understanding of the concept of Queue, you are NOT allowed to use the library of the language that implement queue. You need to write the codes (implementation) of Queue for this exercise. (See point (iii).) The following is just a sample output for your reference. It is by no mean that your output must be the same because the simulation involves a random function (generator). You can also change the format, as long as the required output (The pointer specified above) are available. run: Number of primary servers: 3 Number of secondary servers: 2 ----- Output ----. Number of customers served: 100 Time last service request completed: 480 minutes. Average total service time: 1888/100-18.88 minutes. Average total time in queue: Primary: 716/100 = 7.16 minutes. Secondary: 1716/100 = 17.16 minutes. Total (both) = 24.32 minutes. Average length of queue: Primary: 2636/480 = 5.49. Secondary: 2527/480 - 5.26. Total (both) 10.76 minutes. Maximum length of queue: Primary: 22 Secondary: 32 Total (both) - 54 ---Server data --- P1 P2 P3 330 315 314 Serve Time (in minutes.) 150 164 166 Idle Time (in minutes.) S1 52 466 463 Serve Time (in minutes.) Idle Time (in minutes.) 11 15 End of simulation BUILD SUCCESSFUL (total time: 0 seconds) You should write a Java, program which simulates the queuing and service of a set of requests at a fast-food restaurant. Input consists of the following data: The number of primary servers in the system. The number of secondary servers in the system. • A set of service requests each consisting of an arrival time and two service times. 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). For example, the data file: 32 123 335 322 432 524 000 indicates there are 3 primary servers and 2 secondary servers. The first service (customer) arrives in minute 1 (first minute of simulation), and the service requires 2 minutes of primary server's time and 3 minutes of secondary server's time. The second service (customer) arrives in minute 3, and it requires 3 minutes of primary server's time and 5 minutes of secondary server's time, etc. The last entry of the data file 0 0 0 indicate the end of simulation. (Note that it is possible to have two customers arrive in the same time as shown in the above sample data (second and third customers).) Your program should read the name of the data file from standard input and then read the data in the named file into the simulation. For example, the following command will trigger the execution of your program by reading the data file provided: ./QueueSim datafile.dat or java QueueSim datafile.dat The simulation is to be of a system with two sets of servers, primary and secondary, with a single queue associated with each set. Customers arrive in the system and are served first by a primary server and, on completion of this service, by a secondary server. If all servers of a particular type are busy, the customer will enter either the primary or secondary queue as appropriate. The simulation should be run until the last customer has left the system. Output, to standard output, for each version of the queuing process will consist of the following data: • Number of customers 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. NOTE: Since the question is to assess your understanding of the concept of Queue, you are NOT allowed to use the library of the language that implement queue. You need to write the codes (implementation) of Queue for this exercise. (See point (iii).) The following is just a sample output for your reference. It is by no mean that your output must be the same because the simulation involves a random function (generator). You can also change the format, as long as the required output (The pointer specified above) are available. run: Number of primary servers: 3 Number of secondary servers: 2 ----- Output ----. Number of customers served: 100 Time last service request completed: 480 minutes. Average total service time: 1888/100-18.88 minutes. Average total time in queue: Primary: 716/100 = 7.16 minutes. Secondary: 1716/100 = 17.16 minutes. Total (both) = 24.32 minutes. Average length of queue: Primary: 2636/480 = 5.49. Secondary: 2527/480 - 5.26. Total (both) 10.76 minutes. Maximum length of queue: Primary: 22 Secondary: 32 Total (both) - 54 ---Server data --- P1 P2 P3 330 315 314 Serve Time (in minutes.) 150 164 166 Idle Time (in minutes.) S1 52 466 463 Serve Time (in minutes.) Idle Time (in minutes.) 11 15 End of simulation BUILD SUCCESSFUL (total time: 0 seconds)

Answer rating: 100% (QA)

Creating a complete Java program for this simulation is quite extensive Heres a highlevel outline of the steps you should follow and you can implement ... View the full answer