Assume that we are using STCF scheduling and we have the following schedule of arriving transactions and durations Job Arrival Name Time A B C 1 0 0 Duration 10 13 100 Please complete the following measures (round each answer to the closest integer, if necessary) What is the average turnaround time (show your work)? What is the average response time (show your work)?

Assume that we are using STCF scheduling and we have the following schedule of arriving transactions and durations Job Arrival Name Time A B C 1 0 0 Duration 10 13 100 Please complete the following measures (round each answer to the closest integer, if necessary) What is the average turnaround time (show your work)? What is the average response time (show your work)?

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 1P

See similar textbooks

Similar questions

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
A cipher suite is a choice of algorithms for key exchange, authentication and encryption to be used together in TLS. Cipher suites are specified by an abbreviation such as the following: “ADH-DES-CBC-SHA”. Search online and find one example of a cipher suite used in TLS 1.3. Write the name of the cipher suite; then, for each component, write what the abbreviation stands for and for which cryptographic task that algorithm is used in that suite.
1. Explain the differences in the degree to which the following scheduling algorithms discriminate in favor of short processes: FCFS RR 2. Give a practical example how dead lock occurs.
Problem Which of the following statements about Coinjoin is INCORRECT: A. In Coinjoin, different users jointly create a single Bitcoin transaction that combines all of their inputs. B. When a transaction has multiple inputs coming from different addresses, the signatures corresponding to each input are separate from and independent of each other. C. The order of the input and output addresses is randomized so an outsider will be unable to determine the mapping between inputs and outputs. D. The different addresses in each transaction is controlled by a single user.
Two-phase commit assures that all sites agree as to whether a given transaction T commits or aborts. Suppose there are 3 sites. Transaction coordination C1 sends out the message Prepare T, which isreceived by both C2 and C3. Then C2 and C3 respond with Ready T to C1. Due to some reason, only C2 has the Commit T log record in its stable storage. List all 2PC-related log records on the 3 sitesregarding transaction T. What’s a possible reason that only one ready T has reached C1? Suppose C1 crashes right after the necessary log records from 2 are written to stable storage. During recovery, C1 needs to take some actions. List the additional log records on C2 and C3, and explain the fate of the transaction T.
Two-phase commit assures that all sites agree as to whether a given transaction T commits or aborts. Suppose there are 3 sites. Transaction coordination C1 sends out the message Prepare T, which is received by both C2 and C3. Then C2 and C3 respond with Ready T to C1. Due to some reason, only C2 has the Commit T log record in its stable storage. List all 2PC-related log records on the 3 sites regarding transaction T
12. In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This violates the _______________ condition of deadlock. a. Mutual exclusion b. Hold and Wait c. Circular Wait d. No Preemption
Consider a server that has 20 users, each of which has 50 files in their home directory. Each user should have read and write access to every file in their own home directory. a.If this policy were expressed as a DAC matrix, how many non-empty entries (cells) would the matrix need to have? b. Express this policy as a single if-then sentence, such as might be used in an Attribute-based Access Control (ABAC) system. The sentence should be English, but imagine that it could be translated into a logical constraint.
(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…
Check the given schedule for serializability: T1 T2 T3 T4 R(X) W(X) Commit W(X) Commit W(Y) R(Z) Commit R(X) R(Y) Commit All the methods for checking the serializability should be discussed with well drawn schedules and diagrams, if any.
Consider the schedule S given below S: r₁(X); r₂(Y); r₂(X); r₂(Y); r₂(Z); w₂(Y); w₂(Z); r₁(Z); w₁(x); w₁(Z) Find schedule is conflict serializable or not.
A job scheduler receives job requests with a priority of execution attached to it,in the following sequence. The higher the priority value, the higher the priority of job execution.Job ID: 464 212 110 840 976 343Priority: 3 2 3 1 2 2Build a treap for the jobs scheduled for execution. How would the treap look when the highest priority jobs have completed execution and therefore have quit the treap?