Looking for Java Expert
Budget: ₹1,500 – ₹12,500 INR
Customers come to a single line served by two servers. The time between arrivals is exponentially distributed with an average time between arrivals of 1/λ=15 time units.The service time of a job is exponentially distributed with an average of 1/μ=20 time units.
Customers are serviced for at most 1.5 time units at one time. If they need more service time, they go to the back of the queue of waiting customers (round robin); otherwise they exit the system.
Compare the avg time in the system excluding their service time (exit time-arrival time-service time) for a customer in categories of for the service requirement jobs of 0 to 7 units, 7+ to 14 units, 14+ to 21, 21 units after 10,000 customers exit the system.
Show enough information for the first 15 customers that enter the system to enable to debug the program.
Repeat the above but change the service to FCFS. (A simple way of doing this with little change to your program is to change the quantum of service to be1000.)
Customers are serviced for at most 1.5 time units at one time. If they need more service time, they go to the back of the queue of waiting customers (round robin); otherwise they exit the system.
Compare the avg time in the system excluding their service time (exit time-arrival time-service time) for a customer in categories of for the service requirement jobs of 0 to 7 units, 7+ to 14 units, 14+ to 21, 21 units after 10,000 customers exit the system.
Show enough information for the first 15 customers that enter the system to enable to debug the program.
Repeat the above but change the service to FCFS. (A simple way of doing this with little change to your program is to change the quantum of service to be1000.)