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
Gopher Gallery consists of a shopping mall and a cart ride that covers the 150 acre habitat. There are m visitors and n single-person vehicles. Visitors stroll around the mall at t

Ask question Project Details PROJECT OVERVIEW The ABC Hospital is upgrading their version of Windows. As part of the upgrade, 100 new computers will be purchased. Your task is to


EXPLAIN MULTITASKING IN DETAIL

Explain the Request or Response interface The Request/Response interface is ideal for a message based client-server interaction. By modeling components to interact via a reque

Question : (a) In the demand paging system, when a process tries to access a page that was not brought into memory, a page fault occurs that involves a series of actions. The

explain simple segmentation

Relative file organization A relative file is an array of fixed-length slots and the records can be inserted in the first free slot found from the beginning of the file and

Construct a process tree similar to Figure 1. Look up the Linux command pstree -p and describe what it does. Then type in the command the capture the output.

Q.  You have devised a fresh page-replacement algorithm that you think may be optimal. In a few contorted test cases Belady's anomaly occurs. Is the fresh algorithm optimal? Descr