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
Q. Consider a system that holds 5000 users. Presume that you want to allow 4990 of these users to be able to access one file. a. How would you denote this protection scheme in


Q. Why would it be an awful idea for gateways to pass broadcast packets between networks? What would be the merite of doing so? Answer: All broadcasts would be spreads to all

MEMORY MANAGEMENT USING BIT MAPS   In this memory is separated into different allocation units each of some particular size(a few bites).consider every space of size 4k. A

what is the use of valid invalid bits in paging

What are the five major activities of an operating system in regard to file management? The creation and deletion of files The creation and deletion of directories The s

Problem: a) The CPU can access 2 storage devices directly. What are these 2 storage devices? b) Define 2 key issues involved in memory management. c) How do processes sha

Gang Scheduling : A set of related process is scheduled to execute on a set of processors at the similar time, on a 1-to-1 basis. Closely related processes or threads may be sched

A hard-disk drive reads “120 GB HDD 7200 rpm 3 GB/sec transfer rate”. If the drive has a sector size of 512 bytes, what is the average rotational latency and transfer time to read

Scalability Scalability is the ability of the system to adapt to increased service load. A scalable system will respond more gracefully to increased load than a non scalable on