Suppose a system runs three types of transactions. Transactions of type A runat the rate of 50 per second, transactions of type B run at 100 per second, andtransactions of type C run at 200 per second. Suppose the mix of transactionshas 25 percent of type A, 25 percent of type B, and 50 percent of type C. a. What is the average transaction throughput of the system, assuming there is no interference between the transactions? b. What factors may result in interference between the transactions of different types, leading to the calculated throughput being incorrect?

Suppose a system runs three types of transactions. Transactions of type A runat the rate of 50 per second, transactions of type B run at 100 per second, andtransactions of type C run at 200 per second. Suppose the mix of transactionshas 25 percent of type A, 25 percent of type B, and 50 percent of type C. a. What is the average transaction throughput of the system, assuming there is no interference between the transactions? b. What factors may result in interference between the transactions of different types, leading to the calculated throughput being incorrect?

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 6P

See similar textbooks

Similar questions

4. The method of communication in which transaction takes place in both directions,but only in one direction at a time, is called ? a. Simplex b. Four wire circuit c. Full duplex d. Half-duplex
If a network is to be regarded successful and efficient, what conditions must be met? Let's dissect them one by one and see how they stack up.
Let 2PL be a scheduler based on the two-phase locking protocol and let TS be a scheduler based on the timestamping protocol. Here is a schedule of three transactions:r1(X), w1(X), r2(X), w2(X), r3(Y), w3(Y), r1(Y), w1(Y)Determine the following:Is the schedule serial?Is it serializable?Can it be produced by 2PL?Then, identify the true statement from the list below. a) S is not serial and S cannot be produced by 2PL b) S is serial and S can be produced by 2PL c) S is not serializable and S cannot be produced by TS d) S is not serial and S cannot be produced by TS which one ?
Consider the following scenario: The ABC Bank has many ATM branches all over the country. The customers of the bank use these machines mainly for withdrawing money. Further they can transfer money from one account to another using these machines. Also they can deposit any amount of money into their accounts. The customers can contact a banking assistant through the system if any error occurred during a transaction. The ATM can be filled only by cashier. The system should authenticate the users before they are allowed to use it for the transactions mentioned above. Draw use case diagram for the above scenario Can I have a step-by-step explanation on drawing the use case diagram with the completed use case diagram? Thank you!
let the size of a finite buffer be 10 messages and variable N representing the number of messages currently available in the buffer i) how many semaphores are needed to execute multiple procedures and consumers concurrently and explain why? ii) if N=5 what will happen to a consumer upon a semawait() call iii) if N=10 what will happen to a consumer upon a semawait() call iv) if N=0 will you allow the consumer to access the buffer? What will happen if you fail to block the consumer? v) When you should allow any producer to access the buffer and why
Consider the following two transactions:T34: read(A);read(B);if A = 0 then B := B + 1;write(B).T35: read(B);read(A);if B = 0 then A := A + 1;write(A).Add lock and unlock instructions to transactions T31 and T32 so that they observe the two-phase locking protocol. Can the execution of these transactionsresult in a deadlock?
If a network is to be successful and efficient, what three conditions must be met? Let's separate them out and examine them separately.
Describe a situation in which a user's complete denial of a service (i.e., the user gets no response from the computer) is a significant problem. Describe another case in which a 10% denial of service (i.e., the user's calculation proceeds at a 10% slower pace than normal) is a major problem. Is it possible that unauthorised access to a computer system will result in a ten percent service denial for legitimate users? How would you go about accomplishing that if that's the case?
Consider an Erlang loss system. The average processing time is 6 minutes. The average interarrival time is 5 minutes. The number of servers is 3. What is the average number of occupied servers?
Describe a case in which a user has a major problem due to the complete denial of a service (that is, the user receives no answer from the computer).Describe another case in which a 10% denial of service (the user's calculation advances, but at a 10% slower rate than usual) is a severe issue for that user.Could unlawful access to a computing system result in a 10% denial of service to legitimate users?If so, how so?
Consider the following tele-traffic scenario faced by the Nizwa Firq Telephone Exchange. On a particular day from 6am to 6.15am, the exchange handles 8 calls of average call duration 1 mins. The number of calls and the average call duration both doubles (from its values in previous time slot) every 15 mins untill 7am. Calculate the total traffic handled by the telephone exchange for the time duration 6am to 7am.
(A)Consider the following scheme to reduce message traffic in distributed deadlockdetection. Transactions are assigned unique priorities, and an antagonistic conflict occurswhen a transaction waits for a data object that is locked by a lower priority transaction.Deadlock detection is initiated only when an antagonistic conflict occurs. When a waitingtransaction receives a probe that is initiated by a lower priority transaction, the probe isdiscarded(i) Determine the number of messages exchanged to detect a deadlock in the ‘best’ case.(ii) Determine the number of messages exchanged to detect a deadlock in the ‘average’case.(iii) Determine the number of messages exchanged to detect a deadlock in the ‘worst-case’(iv) Determine the saving (in percentage) in the average number of messages exchangedunder this message traffic reduction scheme as compared to when no such is used(B) Why does the interrupt disable method to achieve mutual exclusion not work formultiprocessor systems?(C) Consider…