شبيه سازي يک سرور با nصف
سیزده سال پیش منتشر شده
تعداد بازدید: 497
کد پروژه: 6297
شرح پروژه
Simulate a series of N M/M/1 queues (called a tandem queue) where
the input to the fi rst queue is Poisson of rate landa and each server serves
at rate mu . The output of queue i becomes the input of queue (i + 1).
Compute the average time a customer spends in the system before
exiting system of queues. You can study this time, but there is no need
to graph it. Here, we are less interested in queueing measurements than
in examining the eff ect of N on actual run time. Plot a graph of N
versus run-time to show that simulation time can go up with N. How
fast it goes up actually depends on (a) the size of the calendar each
time a deletemin operation is performed, and (b) the frequency and
complexity of event processing. Because this example is still simple,
only (a) will matter. So try to make N large
قابل تحویل:
مهارت ها و تخصص های مورد نیاز
مهلت برای انجام
20روز
وضعیت مناقصه
بسته
درباره کارفرما
عضویت سیزده سال پیش
