Explain two-phase locking protocol, Operating System

Q. Show that a few schedules are possible under the two-phase locking protocol however not possible under the timestamp protocol and vice versa.

Answer: A schedule that is authorized in the two-phase locking protocol but not in the timestamp protocol is:

1660_Explain Two-phase locking protocol.png

This schedule isn't allowed in the timestamp protocol because at step 7 the W-timestamp of B is 1.

A schedule that is permitted in the timestamp protocol but not in the two-phase locking protocol is:

2316_Explain Two-phase locking protocol1.png

This schedule can't have lock instructions added to formulate it legal under two-phase locking protocol because T1 must unlock (A) between steps 2 and 3 and must lock (B) between steps 4 and 5.

Posted Date: 7/27/2013 3:54:00 AM | Location : United States







Related Discussions:- Explain two-phase locking protocol, Assignment Help, Ask Question on Explain two-phase locking protocol, Get Answer, Expert's Help, Explain two-phase locking protocol Discussions

Write discussion on Explain two-phase locking protocol
Your posts are moderated
Related Questions
ADVANTAGES AND INCONVENIENCES OF KLT Advantages: the kernel be able to simultaneously schedule many threads of the same process on many processors blocking

What is paging? Paging is a memory management scheme that authorizes the physical-address space of a process to be noncontiguous. Paging evades the considerable problem of fi

explain in detail about ipc in linux

Question: a) Each process is represented in the operating system by a process control block (PCB). The PCB contains many pieces of information associated with a specific proce

Explain in detail about ipc in linux

advantage and dis advantage of threads

Page fault is a trap to the software gained by the hardware when a process accesses a page that is goes in the virtual address space, but not added in physical memory. In the har

Define race condition. When various process access and manipulate similar data concurrently, then the outcome of the execution depends on certain order in which the access take

Q. Explain a mechanism by which one segment could belong to the address space of two different processes. Answer: Because segment tables are a collection of base-limit register

Give a brief introduction about the operation of your program and show that you understand the idea behind threads and mutual exclusion variable. Why do we need to use mutual exclu