2 Assume that we are using SJF scheduling and we have the following schedule of arriving transactions and durations Job Name Arrival Time Duration A 1 10 B 0 13 C 0 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)?

2 Assume that we are using SJF scheduling and we have the following schedule of arriving transactions and durations Job Name Arrival Time Duration A 1 10 B 0 13 C 0 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

Consider a schedule with 4 transactions with 1, 2, 3, and 4 operations respectively. Calculate the possible number ofa) Serial schedulesb) Non serial schedules Please answer these question in detail with full explaination. I need a proper long answer. Thanks :)
Consider the schedule S1 consists of three transactions T1, T2, T3 as the following: Answer the following question: Is the schedule S1 cascadeless and recoverable? Justify your answer. Draw the precedence graph of schedule S1 Is S1 conflict-serializable? Explain briefly. If S1 is conflict-serializable, write down all equivalent serial schedules.
Given the following transaction database: Transaction id Items t1 {1, 3, 4, 6} t2 {2, 3, 5} t3 {1, 2, 3, 5} t4 {2, 5,} t5 {1, 2, 3, 5} t6 {1, 2, 3, 5, 6} What is the output of the Apriori algorithm run on the previous transaction database with a minimum support of 50 % (i.e. 3 out of 6 transactions)? Working steps must be shown.
Consider the schedule S1 = w1(A), r2(A), w1(B), w3(C), r2(C), r4(B), w2(D), w4(E), r5(D), w5(E) on five transactions T1, T2, . . . , T5. How many serial and how many non-serial schedules the above transactions T1, T2, . . . , T5 can have?
Consider a schedule with 3 transactions with 2, 3, and 4 operations respectively. Calculate the possiblenumber ofc) Serial schedulesd) Non serial schedules
Consider two transactions are using a joint account, j. The first transaction attempts to transfer money to b1 and the second transaction attempts to transfer money to b2. Discuss whether the following event can happen. 1) Lost update 2) Deadlock Use an appropriate example/scenario including the interleaving steps if an event can arise or provide a reason if it is not possible for an event to happen.
Let Tran1,Tran2 & Tran3 be three independent transactions. Where Tran1 transfers the one fourth of the A accounts fund to B account. Tran2 updates the balance of the B account by 32% & Tran3 transaction provides two third of the prior balance of the A account (before providing funds to B account) to the charity account. Now write down the concurrent transactions according to the serial given above.
Consider the following schedule: S:R1(A), W2(A), Commit2, W1(A), W3(A), Commit3, Commit1 Which of the following is true and provide the correct reasoning for your answer:(A) The schedule is view serializable schedule and strict recoverable schedule(B) The schedule is non-serializable schedule and strict recoverable schedule(C) The schedule is non-serializable schedule and is not strict recoverable schedule.(D) The Schedule is serializable schedule and is not strict recoverable schedule
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?
The lost update anomaly is said to occur if a transaction Tj reads a data item, then another transaction Tk writes the data item (possibly based on a previous read), after which Tj writes the data item. The update performed by Tk has been lost, since the update done by Tj ignored the value written by Tk. a. Give an example of a schedule showing the lost update anomaly. b. Give an example schedule to show that the lost update anomaly is possible with the read committed isolation level. c. Explain why the lost update anomaly is not possible with the repeatable read isolation level.
2. 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, onlyC2 has the Commit T log record in its stable storage. List all 2PC-related log records on the 3 sitesregarding transaction T.3. Continuing the example of question 2, what’s a possible reason that only one ready T has reached C1?
Consider the following schedule of transactionsW1(A) W2(A) W1(A) W2(A) W1(A)Which of the following properties are true for the above schedule and justify the reason for your answer with explanation?a) Conflict Serializableb) View Serializablec) Recoverable I asked this question before but i think that was incorrect. Please answer these question in detail with full explaination. I need a proper long answer. Thanks .