0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
What is 2pl ink droplet?
Printing upto 4800 dpi it use only 2 pikolitre ink
Explain the strict two-phase locking protocal in dbms?
The strict two-phase locking (S2PL) class of schedules is the intersection of the 2PL class with the class of schedules possessing the Strictness property. To comply with the S2PL protocol a transaction needs to comply with 2PL, and release its write (exclusive) locks only after it has ended, i.e., being either committed or aborted. On the other hand, read (shared) locks are released regularly during phase 2. Implementing general S2PL requires explicit support of phase-1 end, separate from transaction end, and no such widely utilized product implementation is known. S2PL is a special case of 2PL, i.e., the S2PL class is a proper subclass of 2PL
What is the surface area formula for a pyramid?
one half of the perimeter of the base times the slant height plus the area of the base or: 1/2Pl + B
How to find the surface area of a triangular based pyramid?
Surface area of any pyramid is 1/2Pl + B; where P=perimeter of the base, l=slant height and B= Area of the base.
What is the postal address of Prestwick Airport?
The postal address of Prestwick Aiport is, Shaw Rd Ayr, South Ayrshire KA9 2PL, United Kingdom. The phone number is +44 871 223 0700. Prestwick Airport serves the greater Glasgow area.
What is 2 phase locking potocol?
A transaction that follows the 2PL protocol can be divided in to 2 phases. * Expanding phase-new lock on items can acquire but NONE can be released * shrinking phase-existing locks can be released but no new locks can acquire 2 Phase Lock may limit the amount of concurrency that can occur in a schedule.
Difference between 2-phase locking and 2-phase commit?
2PC and 2PL are protocols used in conjunction with distributed databases. Both together are The two phase lock protocol (2PL) deals uniquely with the fact how are locks are acquired during a transaction whereas the two phase commit (2PC) protocol deals with the fact how do multiple hosts decide wether one specific transaction is written (commited) or not (abort). 2PL sais that first there is a phase where locks are (during a transaction) acquired (growth phase) and then there is a phase where the locks are beeing removed (shrinking phase). Once the shrinking phase started no more locks can be acquired during this transaction. The shrinking phase usually takes place after an abort or a commit phase in a typical database system. The essence of 2PC is that after a transaction is complete and should be commited a vote starts. Each node which is part of the transaction is asked to "prepare to commit". The node will then check wether a local commit is possible and if yes it votes with "ready to commit" (RTC) [Important: changes are not beeing written to the database at that point]. Once a node signaled RTC the system must be kept in a state where the transaction is allways commitable. If all nodes signal RTC the transaction the transaction master signals them a commit. If one of the nodes does not signal RTC the transaction master will signal abort to all local transactions.
How long does it take to drive from MA to PA?
Mapquest list the drive as followsTotal Est. Time: 7 hours, 23 minutesTotal Est. Distance: 435.57 mileshttp://www.mapquest.com/directions/main.adp?go=1&do=nw&rmm=1&un=m&cl=EN&ct=NA&rsres=1&1ffi=&1l=&1g=&1pl=&1v=&1n=&2ffi=&2l=&2g=&2pl=&2v=&2n=&1pn=&1a=&1c=&1s=MA&1z=&2pn=&2a=&2c=&2s=PA&2z=&r=f
How long does it take to drive from Bristol to Chester?
It takes 17 hours
8 Explain concurrency control issues in real time systems?
• Concurrency control is the problem of synchronizing concurrent transactions (i.e., order the operations of concurrent transactions) such that the following two propertiesare achieved: - the consistency of the DB is maintained - the maximum degree of concurrency of operations is achieved • Obviously, the serial execution of a set of transaction achieves consistency, if each single transaction is consistent Conflicts • Conflicting operations: Two operations Oij (x) and Okl(x) of transactions Ti and Tk are in conflict iff at least one of the operations is a write, i.e., - Oij = read(x) and Okl = write(x) - Oij = write(x) and Okl = read(x) - Oij = write(x) and Okl = write(x) • Intuitively, a conflict between two operations indicates that their order of execution is important. • Read operations do not conflict with each other, hence the ordering of read operations does not matter. • Example: Consider the following two transactions T1: Read(x) x ← x + 1 Write(x) Commit T2: Read(x) x ← x + 1 Write(x) Commit - To preserve DB consistency, it is important that the read(x) of one transaction is not between read(x) and write(x) of the other transaction. Schedules • A schedule (history) specifies a possibly interleaved order of execution of the operations O of a set of transactions T = {T1, T2, . . . , Tn}, where Ti is specified by a partial order (Σi , ≺i). A schedule can be specified as a partial order over O, where - ΣT =Sn i=1 Σi - ≺T ⊇ Sn i=1 ≺I - For any two conflicting operations Oij , Okl ∈ ΣT , either Oij ≺T Okl or Okl ≺T Oij • A schedule is serial if all transactions in T are executed serially. • Example: Consider the following two transactions T1: Read(x) x ← x + 1 Write(x) Commit T2: Read(x) x ← x + 1 Write(x) Commit - The two serial schedules are S1 = {Σ1, ≺1} and S2 = {Σ2, ≺2}, where Σ1 = Σ2 = {R1(x), W1(x), C1, R2(x), W2(x), C2} ≺1= {(R1, W1),(R1, C1),(W1, C1),(R2, W2),(R2, C2),(W2, C2), (C1, R2), . . . } ≺2= {(R1, W1),(R1, C1),(W1, C1),(R2, W2),(R2, C2),(W2, C2), (C2, R1), . . . } • We will also use the following notation: - {T1, T2} = {R1(x), W1(x), C1, R2(x), W2(x), C2} - {T2, T1} = {R2(x), W2(x), C2, R1(x), W1(x), C1} Serializability • Two schedules are said to be equivalent if they have the same effect on the DB. • Conflict equivalence: Two schedules S1 and S2 defined over the same set of transactions T = {T1, T2, . . . , Tn} are said to be conflict equivalent if for each pair of conflicting operations Oij and Okl , whenever Oij <1 Okl then Oij <2 Okl. - i.e., conflicting operations must be executed in the same order in both transactions. • A concurrent schedule is said to be (conflict-)serializable iff it is conflict equivalent to a serial schedule • A conflict-serializable schedule can be transformed into a serial schedule by swapping non-conflicting operations • Example: Consider the following two schedules T1: Read(x) x ← x + 1 Write(x) Write(z) Commit T2: Read(x) x ← x + 1 Write(x) Commit - The schedule {R1(x), W1(x), R2(x), W2(x), W1(z), C2, C1} is conflict-equivalent to {T1, T2} but not to {T2, T1} Concurrency Control Algorithms • Taxonomy of concurrency control algorithms - Pessimistic methods assume that many transactions will conflict, thus the concurrent execution of transactions is synchronized early in their execution life cycle ∗ Two-Phase Locking (2PL) · Centralized (primary site) 2PL · Primary copy 2PL · Distributed 2PL ∗ Timestamp Ordering (TO) · Basic TO · Multiversion TO · Conservative TO ∗ Hybrid algorithms - Optimistic methods assume that not too many transactions will conflict, thus delay the synchronization of transactions until their termination ∗ Locking-based ∗ Timestamp ordering-based DDB 2008/09 J. Gamper Page 10Locking Based Algorithms • Locking-based concurrency algorithms ensure that data items shared by conflicting operations are accessed in a mutually exclusive way. This is accomplished by associating a "lock" with each such data item. • Two types of locks (lock modes) - read lock (rl) - also called shared lock - write lock (wl) - also called exclusive lock • Compatibility matrix of locks rli(x) wli(x) rlj (x) compatible not compatible wlj (x) not compatible not compatible • General locking algorithm 1. Before using a data item x, transaction requests lock for x from the lock manager 2. If x is already locked and the existing lock is incompatible with the requested lock, the transaction is delayed 3. Otherwise, the lock is granted Locking Based Algorithms • Example: Consider the following two transactions T1: Read(x) x ← x + 1 Write(x) Read(y) y ← y − 1 Write(y) T2: Read(x) x ← x ∗ 2 Write(x) Read(y) y ← y ∗ 2 Write(y) - The following schedule is a valid locking-based schedule (lri(x) indicates the release of a lock on x): S = {wl1(x), R1(x), W1(x), lr1(x) wl2(x), R2(x), W2(x), lr2(x) wl2(y), R2(y), W2(y), lr2(y) wl1(y), R1(y), W1(y), lr1(y)} - However, S is not serializable ∗ S cannot be transformed into a serial schedule by using only non-conflicting swaps ∗ The result is different from the result of any serial execution Two-Phase Locking (2PL) • Two-phase locking protocol - Each transaction is executed in two phases ∗ Growing phase: the transaction obtains locks ∗ Shrinking phase: the transaction releases locks - The lock point is the moment when transitioning from the growing phase to the shrinking phase Two-Phase Locking (2PL) . . . • Properties of the 2PL protocol - Generates conflict-serializable schedules - But schedules may cause cascading aborts ∗ If a transaction aborts after it releases a lock, it may cause other transactions that have accessed the unlocked data item to abort as well • Strict 2PL locking protocol - Holds the locks till the end of the transaction - Cascading aborts are avoided DDB 2008/09 J. Gamper Page 14Two-Phase Locking (2PL) . . . • Example: The schedule S of the previous example is not valid in the 2PL protocol: S = {wl1(x), R1(x), W1(x), lr1(x) wl2(x), R2(x), W2(x), lr2(x) wl2(y), R2(y), W2(y), lr2(y) wl1(y), R1(y), W1(y), lr1(y)} - e.g., after lr1(x) (in line 1) transaction T1 cannot request the lock wl1(y) (in line 4). - Valid schedule in the 2PL protocol S = {wl1(x), R1(x), W1(x), wl1(y), R1(y), W1(y), lr1(x), lr1(y) wl2(x), R2(x), W2(x), wl2(y), R2(y), W2(y), lr2(x), lr2(y)} Timestamp Ordering . . . • Basic timestamp ordering is "aggressive": It tries to execute an operation as soon as it receives it • Conservative timestamp ordering delays each operation until there is an assurance that it will not be restarted, i.e., that no other transaction with a smaller timestamp can arrive - For this, the operations of each transaction are buffered until an ordering can be established so that rejections are not possible • If this condition can be guaranteed, the scheduler will never reject an operation • However, this delay introduces the possibility for deadlocks • Multiversion timestamp ordering - Write operations do not modify the DB; instead, a new version of the data item is created: x1, x2, . . . , xn - Ri(x) is always successful and is performed on the appropriate version of x, i.e., the version of x (say xv) such that wts(xv) is the largest timestamp less than ts(Ti) - Wi(x) produces a new version xw with ts(xw) = ts(Ti) if the scheduler has not yet processed any Rj (xr) on a version xr such that ts(Ti) < rts(xr) i.e., the write is too late. - Otherwise, the write is rejected. • The previous concurrency control algorithms are pessimistic • Optimistic concurrency control algorithms - Delay the validation phase until just before the write phase - Ti run independently at each site on local copies of the DB (without updating the DB) - Validation test then checks whether the updates would maintain the DB consistent: ∗ If yes, all updates are performed ∗ If one fails, all Ti 's are rejected • Potentially allow for a higher level of concurrency Deadlock Management • Deadlock: A set of transactions is in a deadlock situation if several transactions wait for each other. A deadlock requires an outside intervention to take place. • Any locking-based concurrency control algorithm may result in a deadlock, since there is mutual exclusive access to data items and transactions may wait for a lock • Some TO-based algorihtms that require the waiting of transactions may also cause deadlocks • A Wait-for Graph (WFG) is a useful tool to identify deadlocks - The nodes represent transactions - An edge from Ti to Tj indicates that Ti is waiting for Tj - If the WFG has a cycle, we have a deadlock situation • Deadlock management in a DDBMS is more complicate, since lock management is not centralized • We might have global deadlock, which involves transactions running at different sites • A Local Wait-for-Graph (LWFG) may not show the existence of global deadlocks • A Global Wait-for Graph (GWFG), which is the union of all LWFGs, is needed Deadlock Prevention • Deadlock prevention: Guarantee that deadlocks never occur - Check transaction when it is initiated, and start it only if all required resources are available. - All resources which may be needed by a transaction must be predeclared • Advantages - No transaction rollback or restart is involved - Requires no run-time support • Disadvantages - Reduced concurrency due to pre-allocation - Evaluating whether an allocation is safe leads to added overhead - Difficult to determine in advance the required resources Conclusion • Concurrency orders the operations of transactions such that two properties are achieved: (i) the database is always in a consistent state and (ii) the maximum concurrency of operations is achieved • A schedule is some order of the operations of the given transactions. If a set of transactions is executed one after the other, we have a serial schedule. • There are two main groups of serializable concurrency control algorithms: locking based and timestamp based • A transaction is deadlocked if two or more transactions are waiting for each other. A Wait-for graph (WFG) is used to identify deadlocks • Centralized, distributed, and hierarchical schemas can be used to identify deadlocks
Give an example where strict 2 phase locking is followed but the resulting schedule leads to deadlock Explain why the 2PL being followed here is strict and explain why there is deadlock?
T1: Write X // This acquires an exclusive lock: LockXT2: Write Y // This acquires an exclusive lock: LockYT2: Read X // This attempts to acquire a shared lock on X, but since X is locked already by T1, T2 is subsequently blocked by the system until X is freed.T1: Read Y // This attempts to acquire a shared lock on Y, but since Y is locked already by T2, T1 is subsequently blocked by the system until Y is free.T1: Commits // This should release all locks held by T1.T2: Commits // This should release all locks held by T2.* Note that "block" means the transaction will not proceed until the specified condition is met.Now, since T2 is waiting for T1 to free X AND T1 is waiting for T2 to free Y, we get into a cycle of condition checking. These conditions will never be met because both transactions are waiting for the other one to do something, in order to proceed itself. Therefore we have a deadlock between T1 and T2 trying to access the shared resources X and Y.The Wikipedia article on Two-phase locking may help you understand why this is strict 2-phase locking and what 2-phase locking is.
What do you need to present to the judge for dismissal of a traffic violation causing damage to someone vehicle?
Dont Know LOL Play my free rider track -18 1i 18 1i,18 1j 2c 14m,2d 14k 2n 2mo,6s 2k8 6s 2ju,2l 2mg 3f 2nn 4o 2on 6i 2pl 8h 2qf a6 2r1 bq 2rj de 2s6 f1 2so gj 2tb i6 2tu Jo 2uh la 2v4 mr 2vn oc 30a pt 30u re 31h pm 312 oh 30o pt 31c RC 31u sq 32c u0 32k v6 32p 109 32t,12j 371 141 375 15f 36v 171 36f 18i 35k 19s 34q,1co 36s 1e2 37r 1fu 38m 1hs 397 1k4 39i 1m9 39r 1oc 3a3 1qc 3ac 1sa 3al 1u6 3au 201 3b6 21r 3bf 23k 3bo 25b 3c1 272 3ca 28n 3cj 2ac 3ct 2c1 3d6 2dk 3df 2f8 3do 2hb 3e4 2je 3eh 2lh 3et 2nj 3f9 2pk 3fm 2r4 3gt 2s3 3i7 2sr 3jc 2tf 3ko 2u7 3m5 2v3 3nh 301 3ot 315 3q7 32l 3r8 34b 3rt 363 3sg,36e 3u5 417 3sf,459 44b 439 45a 418 463 3v6 46o 3t7 47b 3r9 47u 3pd 48h 3ni 494 3lp 49m 3k0 4a9 3ie 49t 3go 498 3fe 48l 3dt 480 3c3 479 3aa 46d 38g 45g 36m 44l 34r 43s,4c1 3rp 4ln 3rf,48q 41l 452 44c,-3s -c -3p -1b -3k -2b -3d -3g -34 -4n -2f -5l -1f -6a -h -6b -2 -5g 3 -4h 6 -3j 8 -2o 9 -1t 9 -16,-38 -4l 4 -4r,-s -6c -v -4o,-3m -2l -4f -2p -56 -2e -58 -1i -4k -13 -3u -q,9 -31 14 -2q 1i -26 13 -1i b -1c,-12 -9v -v -7u,4s -a7 85 -1r,86 -1s ac -a8 4r -a8,5k -9n 7u -4u,81 -4u 99 -9h,99 -9f 5k -9k,59 -9s 5a -c7,6f -9r 84 -c6,8s -9h am -bl,a2 -8o cg -b3,63 -7h 52 -40,6n -4h 7q 0,8q -3f am -1e,9e -5a c1 -6n,9m -6g CD -7r,94 -6t bh -85,9l -7j dg -8p,9o -4k 7l -p,-43 -l -4m j,-3k -1e -5q -69,-3m -40 -48 -71,-3r -3k -3r -5k,p -3m 3b -5k,k -24 68 -2o,-1t -1j 3s -5a,-13 j 6p -30,-16 h 5e -1j##T 35d 431,T 40l 3re,T 358 3qm,S 1d t
