Scribd Logo
Upload

Welcome to Scribd!

  • 83 views

    Computer Systems Performance Analysis Assignment-2:: R.V.C.E M.Tech, 3 Sem

    Uploaded by

    anisha shetty
    The document is an assignment containing 10 objective questions related to the analysis of open queueing networks. Some key points: - Open queueing networks have arrival rates that are dependent on the system load and number of devices. - Transaction processing systems like banking are examples of closed queueing networks. - The response time of fixed capacity service centers in open networks is given by Ri= Si(1+Qi), which is the general response time law. - Assuming job flow balance, the throughput of the system equals the arrival rate according to Little's law.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd

    Computer Systems Performance Analysis Assignment-2:: R.V.C.E M.Tech, 3 Sem

    Uploaded by

    anisha shetty
    83 views2 pages
    The document is an assignment containing 10 objective questions related to the analysis of open queueing networks. Some key points: - Open queueing networks have arrival rates that are dependent on the system load and number of devices. - Transaction processing systems like banking are examples of closed queueing networks. - The response time of fixed capacity service centers in open networks is given by Ri= Si(1+Qi), which is the general response time law. - Assuming job flow balance, the throughput of the system equals the arrival rate according to Little's law.

    Original Title

    34.1_anisha

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document is an assignment containing 10 objective questions related to the analysis of open queueing networks. Some key points: - Open queueing networks have arrival rates that are dependent on the system load and number of devices. - Transaction processing systems like banking are examples of closed queueing networks. - The response time of fixed capacity service centers in open networks is given by Ri= Si(1+Qi), which is the general response time law. - Assuming job flow balance, the throughput of the system equals the arrival rate according to Little's law.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    83 views2 pages

    Computer Systems Performance Analysis Assignment-2:: R.V.C.E M.Tech, 3 Sem

    Uploaded by

    anisha shetty
    The document is an assignment containing 10 objective questions related to the analysis of open queueing networks. Some key points: - Open queueing networks have arrival rates that are dependent on the system load and number of devices. - Transaction processing systems like banking are examples of closed queueing networks. - The response time of fixed capacity service centers in open networks is given by Ri= Si(1+Qi), which is the general response time law. - Assuming job flow balance, the throughput of the system equals the arrival rate according to Little's law.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 2

    R.V.C.E M.

    Tech,3rd sem
    COMPUTER SYSTEMS PERFORMANCE ANALYSIS

    Assignment-2:
    Objective Questions on Seminar Topic – Analysis of Open Queueing Networks (34.1)

    Submitted By:
    Anisha B S,
    5WF09SPZ02 ,
    M.Tech – CSE (QIP), 3rd sem,
    R. V. C. E.

    1. In open queuing networks the transaction arrival rate is


    a. Not Dependent on the load on the computer system
    b. Number of devices of the computer system
    c. Throughput of the computer system
    d. All of the above

    2. Transaction processing systems like airline reservation systems or banking systems are
    examples for closed queueing networks - True/False

    3. Fixed capacity service centers are


    a. Infinite servers with exponentially distributed service time
    b. Single server with memory less distribution & interarrival times are IID
    c. Single server with exponentially distributed service time
    d. None of the above

    4. For all the fixed-capacity service centers in an open queueing networks, the response
    time is given by
    a. Ri= Si(Qi)
    b. Ri= Si
    c. Ri= Qi
    d. Ri= Si (1+Qi)

    5. Ri= Si (1+Qi) is
    a. Forced Flow law
    b. Little’s Law
    c. Not an operational law
    d. General Response time law

    6. Assuming ___________, the throughput of the system is equal to the arrival rate x = λ
    a. Forced Flow law
    b. Little’s law
    c. Job flow balance

    1
    R.V.C.E M.Tech,3rd sem
    d. Only a & c
    7. Using forced flow law the throughput of the ith device is given by
    a. Xi=Vi
    b. Xi= XVi
    c. Xi=Xλ
    e. Xi=XViSi

    8. The utilization of the ith device using the utilization law is


    a. Ui=XiSi
    b. Ui=XViSi
    c. Ui=λDi
    d. All the above

    9. Match the following: (For open queueing networks)


    1. The queue length of the ith device a. Si /(1 – Ui)
    2. The device respone times are b. Ui /(1 – Ui)
    3. System response time c. ∑ RiVi
    th
    4. Utilization of the i device d. λDi

    a. 1-b.2-c,3-d,4-a b. 1-a,2-b,3-c,4-d c. 1-b,2-a,3-c,4-d

    10. For delay centers the response time & queue length equations are
    a. Ri=Si & Qi= RiXi
    b. Ri= Si /(1 – Ui) & Qi= Ui
    c. Ri = Si & Qi=Ui(1+Qi)
    d. None of the above

    You might also like