In the 2PL algorithm we considered, a transaction can't start until it has acquired all the locks it needs (we call this, Conservative 2PL). There is a different scheme possible, where a transaction does NOT need to wait for all its locks - it can start its transactions before all the locks have been acquired. What would be good about such a scheme, and, what would be bad? Do feel free to illustrate with a diagram.

In the 2PL algorithm we considered, a transaction can't start until it has acquired all the locks it needs (we call this, Conservative 2PL). There is a different scheme possible, where a transaction does NOT need to wait for all its locks - it can start its transactions before all the locks have been acquired. What would be good about such a scheme, and, what would be bad? Do feel free to illustrate with a diagram.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Examine the 9 by 9 matrix for only the options that have precisely two possibilities.Fix one of the two numbers in each of these two-possibility cells and apply the rest of the logic you've developed so far to get as many blank cells as possible. Repeat for the other "twin" of the initial two-possibility cell. If any of the newly found blank cells returns the identical value for both twins, this number is a keeper for that blank cell. Give an example to explain this.
Consider a soldier facing in a given direction (say north). Let us denote "left face" by ℓ,"right face" by r,"about face" by a, and"stand fast" by f. (The element f means "don't move from your present position." It does not mean "return to your original position.") Then we define H = {ℓ, r, a, f} and an operation meaning "followed by." Thus, ℓ ℓ = a means "left face" followed by "left face" and is the same as the single command "about face." Complete the following table. ℓ r a f ℓ a r a f
We can implement requests to the waiter as either a queue of requests or as a periodic retry of a request. With a queue, requests are handled in the order they are received. Th e problem with using the queue is that we may not always be able to service the philosopher whose request is at the head of the queue (due to the unavailability of resources). Describe a scenario with 5 philosophers where a queue is provided, but service is not granted even though there are forks available for another philosopher (whose request is deeper in the queue) to eat.If we implement requests to the waiter by periodically repeating our request until the resources become available, will this solve the problem described in the above Exercise? Explain.
Write algorithm for Check Schedulability (No Locks):Data: Periodic program P without locks, WCET estimates Ci for τiResult: P schedulable or not, and if so WCRT estimate for each task
Let us say we are given the task of building an automated taxi. Define the constraints. What are the inputs? What is the output? How can we communicate with the passenger? Do we need to communicate with the other automated taxis, that is, do we need a "language"? 1.
All businesses want to keep their customers happy. To do that, many companies assign a certain amount of time to each customer to optimize the business. The alternative would be to hire more employees, which would lead to higher costs. This problem requires you to simulate how authorities optimize the number of cashiers at the entrance of a toll bridge to make sure drivers are satisfied. Make the following assumptions: There is one cashier per line. The line works as a queue with no cars cutting the line or leaving it. One car arrives at the entrance every 10 seconds. It takes 90 seconds (1.5 minutes) to process the payment, starting from the moment a cashier is available. Assume there is no pause between cars. Written in java, Your Tasks: Design class CarInLine, with the following specifications: The class has two instance variables: arrivalTime and DepartureTime, stored as integers. Define a constructor that accepts an integer as an argument representing the arrival time, in…
Consider the problem of searching for genes in DNA sequences using Boyer-Moore algorithm. A DNA sequence is represented by a text on the alphabet {A, C, G, T}, and the gene segment is the pattern. Choose the problem instance for your group. (Choose the text and the pattern for your group.) If you choose a different problem instance, your answer will not be accepted and you will get zero for your solution.Construct the bad-symbol shift (?1) table and the good-suffix shift (?2) table.
Algorithm for Check Schedulability With LocksData: Periodic program P with locks, WCET estimates Ci for τi and Ci l,k for lock block Bi l,kResult: P schedulable or not; if schedulable, WCRT estimates for each task
Consider an airport management system. Each airport has a unique id (e.g. Montreal:YUL). Let us introduce the types AIRPORT and CITY . We also introduce variable airports that contains associations between airport id’s and their corresponding host cities. A possible state of the system is shown below:airports ={YUL → Montreal,LCY → London_UKLHR → London_UK,MIL → Milan,SFO → San_Francisco,SDQ → Santo_Domingo}1. (PROGRAMMING) Define global variable airports in Common LISP and populate it with the above data. Demonstrate that the variable indeed contains the ordered pairs as shown above.2. Provide a declaration of variable monitored that holds all airport id’s.3. What kind of variable is airports? Provide a formal definition together with any and all applicable properties.4. Describe what data structure you would deploy to model variable airports. Note that you may not use a Dictionary. Should this be an ordered or an unordered structure? Discuss.5. Provide a formal specification of the…
Use the standard process we saw in class to derive an NFA from the RE ((a∗bc)∗)∗, and then use the subset algorithm to give an equivalent DFA. Either formalizing the DFA/NFA or diagramming them clearly will be sufficient. The final DFA should be labled with sets of NFA states.
Write algorithm for Check Schedulability (No Locks):Data: Periodic program P without locks, WCET estimates Ci for τiResult: P schedulable or not, and if so WCRT estimate for each task
Use the subset construction algorithm from lecture to produce an equivalent DFA from the following NFA. Please show your work so that we know how each state is generated. Name your DFA states so that the link to the NFA states is clear; i.e. you should have DFA states that look like {90, 91}. You will need to show both the table and the diagram in your solution. For full marks, you will need to show all intermediate steps of the algorithm (in tabular form is fine; the DFA diagram is required only for the final DFA). Old State Symbol New State 91 92 1 93 1 94 q1 91 1 92 42 93 92 1 94 93 93 93 1 94 94 94 94 1 95 95 95 The start state of this NFA is qo; the accepting (final) states are qo, q1, and q5.