--%>

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 : Simplified demonstration of Littles Law

    Simplified demonstration of Little’s Law:

    Q : What is Forced Flow Law Forced Flow Law

    Forced Flow Law: • The forced flow law captures the relationship between the various components in the system. It states that the throughputs or flows, in all parts of a system must be proportional t

  • Q : Safety and Liveness in Model Checking

    Safety and Liveness in Model Checking Approach; •? Safety: Nothing bad happens •? Liveness: Something good happens •? Model checking is especially good at verifying safety and liveness properties    –?Concurrency i

  • 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 : Correlation analysis and the regression

    1).  When you take out a mortgage, there are many different kinds of costs.  Usually the two largest are the interest rate (annual percentage that determines the size of your monthly payment) and the loan fee (a one-time percentage charged to you at the time

  • Q : State Kendalls notation

    Kendall’s notation:  A/B/C/K/m/Z A, Inter-arrival distribution M exponential D constant or determ

  • Q : MANOVA and Reflection Activity

    Activity 10:   MANOVA and Reflection   4Comparison of Multiple Outcome Variables This activity introduces you to a very common technique - MANOVA. MANOVA is simply an extension of an ANOV

  • 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

  • Q : Principles of data analysis For the

    For the data analysis project, you will address some questions that interest you with the statistical methodology we are learning in class. You choose the questions; you decide how to collect data; you do the analyses. The questions can address almost any topic,

  • Q : Define SPIN simulation modes SPIN: •

    SPIN: • SPIN generates C program that is the model checker – The pan verifier • Process Analyzer – Run the pan executable to do the model check