--%>

Problem on queuing diagram

Draw a queuing diagram for the systems below and describe them using Kendall’s notation:

A) Single CPU system

B) 4 CPU system, where the arrival times are distributed according to fig a and the service times according to fig b. Requests are serviced according to priorities, with higher priority request pre-empting lower priority ones.

C) A system comprising three web servers, to which requests are randomly directed. Each of the servers contains two CPUs.

2098_curve.jpg

   Related Questions in Basic Statistics

  • Q : Program Evaluation and Review

    Program Evaluation and Review Technique (PERT) A) Developed by US Navy and a consulting firm in 1958 for the Polaris submarine project. B) Technique as for CPM method, but acti

  • Q : Computers playing games How Computers

    How Computers playing games can be categorized according to different dimensions?

  • Q : Simplified demonstration of Littles Law

    Simplified demonstration of Little’s Law:

    Q : Cumulative Frequency and Relative

    Explain differences between Cumulative Frequency and Relative Frequency?

  • Q : Derived quantities in Queuing system

    Derived quantities in Queuing system: • λ = A / T, Arrival rate • X = C / T, Throughput or completion rate • ρ =U= B / T, Utilization &bu

  • Q : Problems on ANOVA We are going to

    We are going to simulate an experiment where we are trying to see whether any of the four automated systems (labeled A, B, C, and D) that we use to produce our root beer result in a different specific gravity than any of the other systems. For this example, we would l

  • Q : Hw An experiment is conducted in which

    An experiment is conducted in which 60 participants each fill out a personality test, but not according to the way they see themselves. Instead, 20 are randomly assigned to fill it out according to the way they think a parent sees them (i.e. how a parent would fill it out to describe the participant

  • Q : Explain Queuing theory Queuing theory :

    Queuing theory: • Queuing theory deals with the analysis of lines where customers wait to receive a service:

    Q : Define Utilization Law Utilization Law

    Utilization Law: • ρk = XK . SK = X . DK • Utilization of a resource is the fraction

  • Q : Explain Service times Service times: A)

    Service times:A) In most cases, servicing a request takes a “short” time, but in a few occasions requests take much longer.B) The probability of completing a service request by time t, is independent of how much tim